./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/floats-esbmc-regression/digits_bad_for.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:27:36,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:27:36,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:27:36,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:27:36,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:27:36,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:27:36,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:27:36,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:27:36,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:27:36,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:27:36,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:27:36,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:27:36,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:27:36,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:27:36,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:27:36,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:27:36,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:27:36,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:27:36,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:27:36,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:27:36,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:27:36,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:27:36,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:27:36,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:27:36,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:27:36,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:27:36,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:27:36,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:27:36,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:27:36,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:27:36,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:27:36,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:27:36,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:27:36,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:27:36,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:27:36,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:27:36,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:27:36,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:27:36,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:27:36,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:27:36,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:27:36,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:27:36,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:27:36,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:27:36,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:27:36,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:27:36,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:27:36,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:27:36,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:27:36,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:27:36,810 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:27:36,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:27:36,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:27:36,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:27:36,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:27:36,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:27:36,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:27:36,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:27:36,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:27:36,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:27:36,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:27:36,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:27:36,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:27:36,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:27:36,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:27:36,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:27:36,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:27:36,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:27:36,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:27:36,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407 [2022-02-20 16:27:37,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:27:37,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:27:37,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:27:37,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:27:37,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:27:37,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c [2022-02-20 16:27:37,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0fc549e/bb82d857c011430c9d2137d2b743cfcd/FLAG24f687925 [2022-02-20 16:27:37,452 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:27:37,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c [2022-02-20 16:27:37,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0fc549e/bb82d857c011430c9d2137d2b743cfcd/FLAG24f687925 [2022-02-20 16:27:37,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0fc549e/bb82d857c011430c9d2137d2b743cfcd [2022-02-20 16:27:37,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:27:37,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:27:37,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:27:37,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:27:37,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:27:37,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:27:37" (1/1) ... [2022-02-20 16:27:37,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d750b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:37, skipping insertion in model container [2022-02-20 16:27:37,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:27:37" (1/1) ... [2022-02-20 16:27:37,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:27:37,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:27:38,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332] [2022-02-20 16:27:38,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:27:38,047 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:27:38,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332] [2022-02-20 16:27:38,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:27:38,075 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:27:38,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38 WrapperNode [2022-02-20 16:27:38,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:27:38,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:27:38,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:27:38,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:27:38,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,104 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-02-20 16:27:38,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:27:38,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:27:38,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:27:38,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:27:38,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:27:38,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:27:38,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:27:38,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:27:38,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (1/1) ... [2022-02-20 16:27:38,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:27:38,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:27:38,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:27:38,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:27:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:27:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:27:38,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:27:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:27:38,226 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:27:38,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:27:38,369 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:27:38,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:27:38,374 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:27:38,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:27:38 BoogieIcfgContainer [2022-02-20 16:27:38,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:27:38,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:27:38,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:27:38,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:27:38,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:27:37" (1/3) ... [2022-02-20 16:27:38,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39819150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:27:38, skipping insertion in model container [2022-02-20 16:27:38,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:38" (2/3) ... [2022-02-20 16:27:38,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39819150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:27:38, skipping insertion in model container [2022-02-20 16:27:38,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:27:38" (3/3) ... [2022-02-20 16:27:38,381 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_bad_for.c [2022-02-20 16:27:38,399 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:27:38,415 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:27:38,469 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:27:38,480 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:27:38,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:27:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:27:38,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:27:38,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:27:38,498 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:27:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:27:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-02-20 16:27:38,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:27:38,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149438831] [2022-02-20 16:27:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:27:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:27:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:27:38,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:27:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:27:38,622 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:27:38,624 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:27:38,625 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:27:38,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:27:38,630 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 16:27:38,633 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:27:38,655 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:27:38,656 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:27:38,656 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2022-02-20 16:27:38,656 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2022-02-20 16:27:38,657 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2022-02-20 16:27:38,657 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2022-02-20 16:27:38,657 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-02-20 16:27:38,657 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 16:27:38,657 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 16:27:38,657 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 16:27:38,658 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 16:27:38,658 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-02-20 16:27:38,658 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:27:38,658 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:27:38,658 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. [2022-02-20 16:27:38,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:27:38 BoogieIcfgContainer [2022-02-20 16:27:38,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:27:38,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:27:38,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:27:38,661 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:27:38,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:27:38" (3/4) ... [2022-02-20 16:27:38,665 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:27:38,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:27:38,667 INFO L158 Benchmark]: Toolchain (without parser) took 785.69ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 70.9MB in the end (delta: 18.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-02-20 16:27:38,668 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 39.6MB in the beginning and 39.5MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:27:38,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.20ms. Allocated memory is still 121.6MB. Free memory was 89.0MB in the beginning and 97.6MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:27:38,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.35ms. Allocated memory is still 121.6MB. Free memory was 97.6MB in the beginning and 95.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:27:38,670 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 121.6MB. Free memory was 95.9MB in the beginning and 94.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:27:38,673 INFO L158 Benchmark]: RCFGBuilder took 240.32ms. Allocated memory is still 121.6MB. Free memory was 94.7MB in the beginning and 85.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:27:38,673 INFO L158 Benchmark]: TraceAbstraction took 283.16ms. Allocated memory is still 121.6MB. Free memory was 85.0MB in the beginning and 71.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:27:38,674 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 121.6MB. Free memory was 71.3MB in the beginning and 70.9MB in the end (delta: 364.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:27:38,680 INFO L339 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.14ms. Allocated memory is still 83.9MB. Free memory was 39.6MB in the beginning and 39.5MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.20ms. Allocated memory is still 121.6MB. Free memory was 89.0MB in the beginning and 97.6MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.35ms. Allocated memory is still 121.6MB. Free memory was 97.6MB in the beginning and 95.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 121.6MB. Free memory was 95.9MB in the beginning and 94.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 240.32ms. Allocated memory is still 121.6MB. Free memory was 94.7MB in the beginning and 85.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 283.16ms. Allocated memory is still 121.6MB. Free memory was 85.0MB in the beginning and 71.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 121.6MB. Free memory was 71.3MB in the beginning and 70.9MB in the end (delta: 364.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 11, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L11] COND FALSE !(x != 0) VAL [i=1, res=0] [L17] CALL __VERIFIER_assert(res > 67050) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:27:38,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/floats-esbmc-regression/digits_bad_for.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:27:40,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:27:40,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:27:40,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:27:40,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:27:40,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:27:40,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:27:40,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:27:40,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:27:40,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:27:40,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:27:40,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:27:40,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:27:40,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:27:40,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:27:40,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:27:40,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:27:40,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:27:40,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:27:40,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:27:40,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:27:40,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:27:40,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:27:40,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:27:40,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:27:40,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:27:40,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:27:40,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:27:40,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:27:40,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:27:40,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:27:40,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:27:40,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:27:40,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:27:40,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:27:40,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:27:40,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:27:40,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:27:40,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:27:40,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:27:40,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:27:40,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:27:40,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:27:40,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:27:40,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:27:40,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:27:40,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:27:40,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:27:40,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:27:40,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:27:40,464 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:27:40,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:27:40,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:27:40,465 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:27:40,466 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:27:40,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:27:40,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:27:40,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:27:40,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:27:40,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:27:40,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:27:40,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:27:40,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:27:40,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:27:40,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:27:40,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:27:40,467 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:27:40,467 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:27:40,468 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:27:40,468 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:27:40,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:27:40,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:27:40,468 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 7a282122dc24d7edcdab0235b368fb11c8475c7879a31ec8b05ebbedfee80407 [2022-02-20 16:27:40,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:27:40,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:27:40,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:27:40,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:27:40,754 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:27:40,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c [2022-02-20 16:27:40,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8144193f/e0caf4ba69ad44d285a063ca99213254/FLAG290396d83 [2022-02-20 16:27:41,181 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:27:41,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c [2022-02-20 16:27:41,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8144193f/e0caf4ba69ad44d285a063ca99213254/FLAG290396d83 [2022-02-20 16:27:41,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8144193f/e0caf4ba69ad44d285a063ca99213254 [2022-02-20 16:27:41,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:27:41,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:27:41,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:27:41,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:27:41,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:27:41,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73859159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41, skipping insertion in model container [2022-02-20 16:27:41,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:27:41,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:27:41,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332] [2022-02-20 16:27:41,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:27:41,364 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:27:41,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_for.c[319,332] [2022-02-20 16:27:41,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:27:41,430 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:27:41,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41 WrapperNode [2022-02-20 16:27:41,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:27:41,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:27:41,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:27:41,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:27:41,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,457 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-02-20 16:27:41,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:27:41,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:27:41,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:27:41,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:27:41,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:27:41,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:27:41,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:27:41,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:27:41,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (1/1) ... [2022-02-20 16:27:41,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:27:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:27:41,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:27:41,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:27:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:27:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:27:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:27:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:27:41,608 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:27:41,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:27:43,856 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:27:43,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:27:43,860 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:27:43,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:27:43 BoogieIcfgContainer [2022-02-20 16:27:43,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:27:43,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:27:43,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:27:43,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:27:43,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:27:41" (1/3) ... [2022-02-20 16:27:43,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ba7135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:27:43, skipping insertion in model container [2022-02-20 16:27:43,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:27:41" (2/3) ... [2022-02-20 16:27:43,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ba7135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:27:43, skipping insertion in model container [2022-02-20 16:27:43,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:27:43" (3/3) ... [2022-02-20 16:27:43,865 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_bad_for.c [2022-02-20 16:27:43,874 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:27:43,874 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:27:43,914 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:27:43,920 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:27:43,921 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:27:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:27:43,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:27:43,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:27:43,937 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:27:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:27:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-02-20 16:27:43,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:27:43,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354105580] [2022-02-20 16:27:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:27:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:27:43,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:27:43,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:27:43,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:27:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:27:44,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:27:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:27:44,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:27:44,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {15#true} is VALID [2022-02-20 16:27:44,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~i~0#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {23#(= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))} is VALID [2022-02-20 16:27:44,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#(= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {16#false} is VALID [2022-02-20 16:27:44,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsgt64(main_~res~0#1, 67050bv64) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 16:27:44,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 16:27:44,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 16:27:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:27:44,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:27:44,133 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:27:44,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354105580] [2022-02-20 16:27:44,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354105580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:27:44,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:27:44,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:27:44,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084475054] [2022-02-20 16:27:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:27:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 16:27:44,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:27:44,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:44,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:27:44,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:27:44,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:27:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:27:44,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:27:44,172 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:46,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:27:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:27:46,575 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 16:27:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:27:46,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 16:27:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:27:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-02-20 16:27:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-02-20 16:27:46,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-02-20 16:27:47,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:27:47,077 INFO L225 Difference]: With dead ends: 21 [2022-02-20 16:27:47,077 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 16:27:47,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:27:47,081 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:27:47,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 16:27:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 16:27:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 16:27:47,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:27:47,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:47,104 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:47,104 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:27:47,105 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 16:27:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 16:27:47,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:27:47,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:27:47,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 16:27:47,106 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 16:27:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:27:47,107 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 16:27:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 16:27:47,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:27:47,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:27:47,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:27:47,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:27:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 16:27:47,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-02-20 16:27:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:27:47,110 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 16:27:47,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:27:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 16:27:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:27:47,110 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:27:47,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:27:47,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:27:47,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:27:47,312 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:27:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:27:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-02-20 16:27:47,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:27:47,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281869127] [2022-02-20 16:27:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:27:47,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:27:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:27:47,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:27:47,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:27:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:27:47,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:27:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:27:47,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:27:49,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {96#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:27:49,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~i~0#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {100#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:27:49,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1)))); {104#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:27:49,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {104#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:27:49,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {104#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {92#false} is VALID [2022-02-20 16:27:49,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {92#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsgt64(main_~res~0#1, 67050bv64) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {92#false} is VALID [2022-02-20 16:27:49,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {92#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {92#false} is VALID [2022-02-20 16:27:49,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {92#false} assume !false; {92#false} is VALID [2022-02-20 16:27:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:27:49,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:27:55,572 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:27:57,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {92#false} assume !false; {92#false} is VALID [2022-02-20 16:27:57,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {92#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {92#false} is VALID [2022-02-20 16:27:57,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {92#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsgt64(main_~res~0#1, 67050bv64) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {92#false} is VALID [2022-02-20 16:27:57,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {129#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {92#false} is VALID [2022-02-20 16:27:57,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {129#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {129#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:27:57,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1)))); {129#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:27:59,463 WARN L290 TraceCheckUtils]: 1: Hoare triple {91#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~i~0#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {136#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is UNKNOWN [2022-02-20 16:27:59,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {91#true} is VALID [2022-02-20 16:27:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-20 16:27:59,464 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:27:59,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281869127] [2022-02-20 16:27:59,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281869127] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:27:59,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:27:59,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 16:27:59,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273217930] [2022-02-20 16:27:59,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:27:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:27:59,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:27:59,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:03,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 12 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:28:03,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:28:03,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:28:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:28:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=18, Unknown=1, NotChecked=8, Total=42 [2022-02-20 16:28:03,913 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:05,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:28:08,116 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-02-20 16:28:10,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:28:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:19,488 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-20 16:28:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:28:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:28:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:28:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-20 16:28:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-20 16:28:19,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-02-20 16:28:24,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 13 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 16:28:24,402 INFO L225 Difference]: With dead ends: 15 [2022-02-20 16:28:24,402 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:28:24,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=17, Invalid=19, Unknown=2, NotChecked=18, Total=56 [2022-02-20 16:28:24,404 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:28:24,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 4 Unchecked, 4.4s Time] [2022-02-20 16:28:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:28:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:28:24,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:28:24,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:24,406 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:24,406 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:24,408 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:28:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:28:24,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:28:24,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:28:24,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:28:24,409 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:28:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:24,410 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:28:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:28:24,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:28:24,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:28:24,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:28:24,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:28:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:28:24,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2022-02-20 16:28:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:28:24,412 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:28:24,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:28:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:28:24,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:28:24,412 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 16:28:24,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:28:24,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:28:24,613 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:28:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:28:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1489078833, now seen corresponding path program 2 times [2022-02-20 16:28:24,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:28:24,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244689642] [2022-02-20 16:28:24,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:28:24,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:28:24,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:28:24,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:28:24,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:28:25,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:28:25,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:28:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:28:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:28:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:28:33,341 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-02-20 16:28:37,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {203#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:28:37,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~i~0#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {207#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:37,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1)))); {211#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:37,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {211#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:37,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {211#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1)))); {218#(and (= |ULTIMATE.start_main_~x~0#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32))))))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:37,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#(and (= |ULTIMATE.start_main_~x~0#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32))))))))) (= currentRoundingMode roundNearestTiesToEven))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {218#(and (= |ULTIMATE.start_main_~x~0#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32))))))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:37,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {218#(and (= |ULTIMATE.start_main_~x~0#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32))))))))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {199#false} is VALID [2022-02-20 16:28:37,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsgt64(main_~res~0#1, 67050bv64) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {199#false} is VALID [2022-02-20 16:28:37,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {199#false} is VALID [2022-02-20 16:28:37,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-02-20 16:28:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 16:28:37,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:28:44,020 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:28:46,092 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-02-20 16:28:56,679 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:28:58,818 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true