./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.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/float-benchs/rlim_invariant.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 d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:24:38,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:24:38,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:24:38,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:24:38,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:24:38,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:24:38,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:24:38,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:24:38,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:24:38,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:24:38,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:24:38,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:24:38,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:24:38,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:24:38,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:24:38,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:24:38,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:24:38,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:24:38,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:24:38,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:24:38,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:24:38,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:24:38,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:24:38,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:24:38,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:24:38,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:24:38,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:24:38,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:24:38,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:24:38,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:24:38,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:24:38,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:24:38,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:24:38,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:24:38,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:24:38,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:24:38,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:24:38,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:24:38,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:24:38,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:24:38,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:24:38,756 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:24:38,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:24:38,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:24:38,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:24:38,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:24:38,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:24:38,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:24:38,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:24:38,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:24:38,779 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:24:38,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:24:38,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:24:38,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:24:38,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:24:38,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:24:38,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:24:38,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:24:38,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:24:38,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:24:38,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:38,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:24:38,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:24:38,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:24:38,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:24:38,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:24:38,784 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:24:38,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:24:38,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:24:38,784 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 -> d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 [2022-02-20 16:24:38,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:24:38,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:24:38,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:24:38,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:24:38,975 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:24:38,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c [2022-02-20 16:24:39,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5430281a9/e3c51e9e576b4773a4f84eb55f91a427/FLAG91c7f0dac [2022-02-20 16:24:39,477 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:24:39,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c [2022-02-20 16:24:39,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5430281a9/e3c51e9e576b4773a4f84eb55f91a427/FLAG91c7f0dac [2022-02-20 16:24:39,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5430281a9/e3c51e9e576b4773a4f84eb55f91a427 [2022-02-20 16:24:39,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:24:39,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:24:39,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:39,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:24:39,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:24:39,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:39" (1/1) ... [2022-02-20 16:24:39,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268b524d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:39, skipping insertion in model container [2022-02-20 16:24:39,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:39" (1/1) ... [2022-02-20 16:24:39,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:24:39,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:24:40,159 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/float-benchs/rlim_invariant.c[451,464] [2022-02-20 16:24:40,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:40,189 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:24:40,200 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/float-benchs/rlim_invariant.c[451,464] [2022-02-20 16:24:40,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:40,218 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:24:40,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40 WrapperNode [2022-02-20 16:24:40,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:40,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:40,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:24:40,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:24:40,224 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:24:40" (1/1) ... [2022-02-20 16:24:40,228 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:24:40" (1/1) ... [2022-02-20 16:24:40,244 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-20 16:24:40,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:40,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:24:40,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:24:40,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:24:40,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:24:40,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:24:40,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:24:40,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:24:40,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (1/1) ... [2022-02-20 16:24:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:24:40,299 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:24:40,316 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:24:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:24:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 16:24:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 16:24:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:24:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:24:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:24:40,367 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:24:40,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:24:40,491 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:24:40,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:24:40,511 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:24:40,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:40 BoogieIcfgContainer [2022-02-20 16:24:40,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:24:40,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:24:40,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:24:40,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:24:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:24:39" (1/3) ... [2022-02-20 16:24:40,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ba205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:40, skipping insertion in model container [2022-02-20 16:24:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:40" (2/3) ... [2022-02-20 16:24:40,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ba205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:40, skipping insertion in model container [2022-02-20 16:24:40,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:40" (3/3) ... [2022-02-20 16:24:40,517 INFO L111 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c [2022-02-20 16:24:40,520 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:24:40,520 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:24:40,567 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:24:40,571 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:24:40,572 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:24:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:24:40,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:40,590 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:40,591 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1358229485, now seen corresponding path program 1 times [2022-02-20 16:24:40,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:24:40,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675942664] [2022-02-20 16:24:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:40,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:24:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:40,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 16:24:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:40,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 16:24:40,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 16:24:40,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 16:24:40,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#false} {25#true} #55#return; {26#false} is VALID [2022-02-20 16:24:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 16:24:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:40,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 16:24:40,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 16:24:40,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 16:24:40,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#false} {26#false} #57#return; {26#false} is VALID [2022-02-20 16:24:40,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-02-20 16:24:40,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post4#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(0);main_~i~0#1 := 0; {25#true} is VALID [2022-02-20 16:24:40,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume !!(main_~i~0#1 < 100000);main_~X~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {25#true} is VALID [2022-02-20 16:24:40,745 INFO L272 TraceCheckUtils]: 3: Hoare triple {25#true} call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(main_~X~0#1, ~someUnaryFLOAToperation(128.0)) && ~someBinaryFLOATComparisonOperation(main_~X~0#1, 128.0) then 1 else 0)); {25#true} is VALID [2022-02-20 16:24:40,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 16:24:40,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 16:24:40,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 16:24:40,746 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {26#false} {25#true} #55#return; {26#false} is VALID [2022-02-20 16:24:40,747 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(main_~D~0#1, 0.0) && ~someBinaryFLOATComparisonOperation(main_~D~0#1, 16.0) then 1 else 0)); {25#true} is VALID [2022-02-20 16:24:40,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 16:24:40,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 16:24:40,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 16:24:40,748 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {26#false} {26#false} #57#return; {26#false} is VALID [2022-02-20 16:24:40,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~someBinaryArithmeticFLOAToperation(main_~X~0#1, main_~S~0#1); {26#false} is VALID [2022-02-20 16:24:40,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {26#false} assume ~someBinaryFLOATComparisonOperation(main_~R~0#1, ~someUnaryFLOAToperation(main_~D~0#1));main_~Y~0#1 := ~someBinaryArithmeticFLOAToperation(main_~S~0#1, main_~D~0#1); {26#false} is VALID [2022-02-20 16:24:40,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {26#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~Y~0#1, ~someUnaryFLOAToperation(129.0)) && ~someBinaryFLOATComparisonOperation(main_~Y~0#1, 129.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 16:24:40,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 16:24:40,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 16:24:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:24:40,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:24:40,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675942664] [2022-02-20 16:24:40,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675942664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:40,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:40,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:24:40,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206300763] [2022-02-20 16:24:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:40,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 16:24:40,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:40,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:40,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:40,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:24:40,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:24:40,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:24:40,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:40,827 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:40,856 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 16:24:40,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:24:40,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 16:24:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 16:24:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 16:24:40,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2022-02-20 16:24:40,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:40,956 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:24:40,956 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:24:40,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:40,960 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:40,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:24:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:24:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:24:41,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:41,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:41,010 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:41,023 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:41,027 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 16:24:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:24:41,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:41,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:41,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 16:24:41,028 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 16:24:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:41,030 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 16:24:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:24:41,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:41,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:41,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:41,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 16:24:41,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 18 [2022-02-20 16:24:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:41,035 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 16:24:41,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:24:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:24:41,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:41,045 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:41,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:24:41,046 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:41,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -37923155, now seen corresponding path program 1 times [2022-02-20 16:24:41,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:24:41,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589093332] [2022-02-20 16:24:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:24:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:24:41,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:24:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:24:41,116 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:24:41,131 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:24:41,142 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:24:41,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:24:41,146 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:24:41,148 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:24:41,155 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~X~0, ~someUnaryFLOAToperation(128.0)) && ~someBinaryFLOATComparisonOperation(~X~0, 128.0) then 1 else 0)); [2022-02-20 16:24:41,163 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:24:41,166 INFO L158 Benchmark]: Toolchain (without parser) took 1233.15ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-02-20 16:24:41,167 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:41,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.68ms. Allocated memory is still 117.4MB. Free memory was 85.0MB in the beginning and 93.1MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:24:41,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.66ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 91.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:41,168 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 90.5MB in the end (delta: 929.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:41,168 INFO L158 Benchmark]: RCFGBuilder took 237.04ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 80.5MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:24:41,170 INFO L158 Benchmark]: TraceAbstraction took 652.25ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 82.4MB in the end (delta: -2.3MB). Peak memory consumption was 55.9kB. Max. memory is 16.1GB. [2022-02-20 16:24:41,171 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.13ms. Allocated memory is still 83.9MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.68ms. Allocated memory is still 117.4MB. Free memory was 85.0MB in the beginning and 93.1MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.66ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 91.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 90.5MB in the end (delta: 929.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.04ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 80.5MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 652.25ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 82.4MB in the end (delta: -2.3MB). Peak memory consumption was 55.9kB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:24:41,203 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/float-benchs/rlim_invariant.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 d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:24:43,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:24:43,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:24:43,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:24:43,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:24:43,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:24:43,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:24:43,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:24:43,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:24:43,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:24:43,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:24:43,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:24:43,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:24:43,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:24:43,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:24:43,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:24:43,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:24:43,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:24:43,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:24:43,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:24:43,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:24:43,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:24:43,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:24:43,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:24:43,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:24:43,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:24:43,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:24:43,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:24:43,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:24:43,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:24:43,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:24:43,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:24:43,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:24:43,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:24:43,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:24:43,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:24:43,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:24:43,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:24:43,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:24:43,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:24:43,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:24:43,271 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:24:43,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:24:43,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:24:43,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:24:43,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:24:43,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:24:43,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:24:43,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:24:43,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:24:43,305 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:24:43,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:24:43,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:24:43,306 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:24:43,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:24:43,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:24:43,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:24:43,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:24:43,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:24:43,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:24:43,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:24:43,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:43,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:24:43,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:24:43,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:24:43,308 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:24:43,308 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:24:43,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:24:43,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:24:43,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:24:43,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:24:43,309 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 -> d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 [2022-02-20 16:24:43,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:24:43,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:24:43,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:24:43,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:24:43,620 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:24:43,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c [2022-02-20 16:24:43,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce5431c2/fbe4274568ab4dfea3a96bcac7d65ec8/FLAGe8e5af291 [2022-02-20 16:24:44,026 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:24:44,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c [2022-02-20 16:24:44,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce5431c2/fbe4274568ab4dfea3a96bcac7d65ec8/FLAGe8e5af291 [2022-02-20 16:24:44,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce5431c2/fbe4274568ab4dfea3a96bcac7d65ec8 [2022-02-20 16:24:44,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:24:44,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:24:44,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:44,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:24:44,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:24:44,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b3f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44, skipping insertion in model container [2022-02-20 16:24:44,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:24:44,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:24:44,177 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/float-benchs/rlim_invariant.c[451,464] [2022-02-20 16:24:44,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:44,215 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:24:44,265 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/float-benchs/rlim_invariant.c[451,464] [2022-02-20 16:24:44,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:44,291 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:24:44,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44 WrapperNode [2022-02-20 16:24:44,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:44,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:44,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:24:44,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:24:44,298 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:24:44" (1/1) ... [2022-02-20 16:24:44,304 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:24:44" (1/1) ... [2022-02-20 16:24:44,320 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 16:24:44,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:44,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:24:44,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:24:44,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:24:44,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:24:44,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:24:44,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:24:44,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:24:44,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (1/1) ... [2022-02-20 16:24:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:44,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:24:44,373 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:24:44,390 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:24:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:24:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:24:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 16:24:44,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 16:24:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:24:44,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:24:44,455 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:24:44,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:24:44,612 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:24:44,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:24:44,620 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:24:44,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:44 BoogieIcfgContainer [2022-02-20 16:24:44,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:24:44,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:24:44,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:24:44,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:24:44,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:24:44" (1/3) ... [2022-02-20 16:24:44,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bdf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:44, skipping insertion in model container [2022-02-20 16:24:44,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:44" (2/3) ... [2022-02-20 16:24:44,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bdf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:44, skipping insertion in model container [2022-02-20 16:24:44,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:44" (3/3) ... [2022-02-20 16:24:44,626 INFO L111 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c [2022-02-20 16:24:44,629 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:24:44,629 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:24:44,654 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:24:44,658 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:24:44,659 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:24:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:24:44,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:44,673 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:44,673 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1358229485, now seen corresponding path program 1 times [2022-02-20 16:24:44,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:44,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001817276] [2022-02-20 16:24:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:44,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:44,688 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:24:44,689 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:24:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:44,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:24:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:44,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:44,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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); {25#true} is VALID [2022-02-20 16:24:44,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post4#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(currentRoundingMode, 0bv32);main_~i~0#1 := 0bv32; {25#true} is VALID [2022-02-20 16:24:44,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume !!~bvslt32(main_~i~0#1, 100000bv32);main_~X~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {25#true} is VALID [2022-02-20 16:24:44,856 INFO L272 TraceCheckUtils]: 3: Hoare triple {25#true} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~X~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 128.0))) && ~fp.leq~FLOAT(main_~X~0#1, ~to_fp~FLOAT(currentRoundingMode, 128.0)) then 1bv32 else 0bv32)); {25#true} is VALID [2022-02-20 16:24:44,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 16:24:44,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} assume 0bv32 == ~cond;assume false; {25#true} is VALID [2022-02-20 16:24:44,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume true; {25#true} is VALID [2022-02-20 16:24:44,857 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25#true} {25#true} #55#return; {25#true} is VALID [2022-02-20 16:24:44,858 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#true} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~D~0#1, ~Pluszero~FLOAT()) && ~fp.leq~FLOAT(main_~D~0#1, ~to_fp~FLOAT(currentRoundingMode, 16.0)) then 1bv32 else 0bv32)); {25#true} is VALID [2022-02-20 16:24:44,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 16:24:44,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#true} assume 0bv32 == ~cond;assume false; {26#false} is VALID [2022-02-20 16:24:44,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 16:24:44,859 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {26#false} {25#true} #57#return; {26#false} is VALID [2022-02-20 16:24:44,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~X~0#1, main_~S~0#1); {26#false} is VALID [2022-02-20 16:24:44,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {26#false} assume ~fp.leq~FLOAT(main_~R~0#1, ~fp.neg~FLOAT(main_~D~0#1));main_~Y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~S~0#1, main_~D~0#1); {26#false} is VALID [2022-02-20 16:24:44,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {26#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~Y~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 129.0))) && ~fp.leq~FLOAT(main_~Y~0#1, ~to_fp~FLOAT(currentRoundingMode, 129.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 16:24:44,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {26#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 16:24:44,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 16:24:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:24:44,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:24:44,862 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:44,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001817276] [2022-02-20 16:24:44,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001817276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:44,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:44,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:24:44,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496201651] [2022-02-20 16:24:44,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:44,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 16:24:44,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:44,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:44,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:44,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:24:44,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:24:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:44,921 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:45,069 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 16:24:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:24:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 16:24:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 16:24:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 16:24:45,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2022-02-20 16:24:45,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:45,196 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:24:45,197 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:24:45,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:45,201 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:45,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:24:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:24:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:24:45,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:45,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:45,232 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:45,233 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:45,236 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 16:24:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:24:45,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:45,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:45,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 16:24:45,241 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 16:24:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:45,245 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 16:24:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:24:45,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:45,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:45,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:45,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:24:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 16:24:45,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 18 [2022-02-20 16:24:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:45,253 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 16:24:45,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:24:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:24:45,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:45,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:45,272 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:24:45,469 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:24:45,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash -37923155, now seen corresponding path program 1 times [2022-02-20 16:24:45,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:45,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695871527] [2022-02-20 16:24:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:45,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:45,476 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:24:45,477 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:24:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:45,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:24:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:45,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:45,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#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); {198#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:45,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post4#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(currentRoundingMode, 0bv32);main_~i~0#1 := 0bv32; {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~bvslt32(main_~i~0#1, 100000bv32);main_~X~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,977 INFO L272 TraceCheckUtils]: 3: Hoare triple {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~X~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 128.0))) && ~fp.leq~FLOAT(main_~X~0#1, ~to_fp~FLOAT(currentRoundingMode, 128.0)) then 1bv32 else 0bv32)); {198#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:45,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {198#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:45,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {198#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:45,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(= currentRoundingMode roundNearestTiesToEven)} assume true; {198#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:45,980 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {198#(= currentRoundingMode roundNearestTiesToEven)} {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} #55#return; {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,981 INFO L272 TraceCheckUtils]: 8: Hoare triple {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~D~0#1, ~Pluszero~FLOAT()) && ~fp.leq~FLOAT(main_~D~0#1, ~to_fp~FLOAT(currentRoundingMode, 16.0)) then 1bv32 else 0bv32)); {198#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:45,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {227#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == ~cond); {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume true; {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,983 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} {202#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} #57#return; {238#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~X~0#1, main_~S~0#1); {242#(and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~S~0#1|) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#(and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~S~0#1|) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~FLOAT(main_~R~0#1, ~fp.neg~FLOAT(main_~D~0#1));main_~Y~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~S~0#1, main_~D~0#1); {246#(and (exists ((|ULTIMATE.start_main_~D~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~D~0#1|) |ULTIMATE.start_main_~Y~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:45,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#(and (exists ((|ULTIMATE.start_main_~D~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~D~0#1|) |ULTIMATE.start_main_~Y~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~Y~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 129.0))) && ~fp.leq~FLOAT(main_~Y~0#1, ~to_fp~FLOAT(currentRoundingMode, 129.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {250#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 16:24:45,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {250#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {194#false} is VALID [2022-02-20 16:24:45,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {194#false} assume !false; {194#false} is VALID [2022-02-20 16:24:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:24:45,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:24:45,991 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:45,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695871527] [2022-02-20 16:24:45,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695871527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:45,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:45,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:24:45,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371199778] [2022-02-20 16:24:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:45,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 16:24:45,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:45,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:46,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:46,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:24:46,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:24:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:24:46,036 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:48,289 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-02-20 16:24:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:24:48,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 16:24:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-02-20 16:24:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-02-20 16:24:48,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-02-20 16:24:48,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:48,422 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:24:48,422 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:24:48,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:24:48,423 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:48,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 12 Unchecked, 1.1s Time] [2022-02-20 16:24:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:24:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2022-02-20 16:24:48,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:48,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:48,429 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:48,429 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:48,431 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 16:24:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-20 16:24:48,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:48,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:48,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-02-20 16:24:48,435 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-02-20 16:24:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:48,440 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 16:24:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-20 16:24:48,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:48,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:48,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:48,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-20 16:24:48,447 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2022-02-20 16:24:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:48,448 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-20 16:24:48,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-20 16:24:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:24:48,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:48,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:48,459 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:24:48,653 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:24:48,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1173892842, now seen corresponding path program 1 times [2022-02-20 16:24:48,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:48,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782493712] [2022-02-20 16:24:48,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:48,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:48,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:48,658 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:24:48,660 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:24:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:48,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:24:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:48,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:49,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {433#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); {438#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:49,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post4#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(currentRoundingMode, 0bv32);main_~i~0#1 := 0bv32; {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~bvslt32(main_~i~0#1, 100000bv32);main_~X~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,070 INFO L272 TraceCheckUtils]: 3: Hoare triple {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~X~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 128.0))) && ~fp.leq~FLOAT(main_~X~0#1, ~to_fp~FLOAT(currentRoundingMode, 128.0)) then 1bv32 else 0bv32)); {438#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:49,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {438#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {438#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:49,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {438#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:49,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#(= currentRoundingMode roundNearestTiesToEven)} assume true; {438#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:49,072 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {438#(= currentRoundingMode roundNearestTiesToEven)} {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} #55#return; {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,073 INFO L272 TraceCheckUtils]: 8: Hoare triple {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~D~0#1, ~Pluszero~FLOAT()) && ~fp.leq~FLOAT(main_~D~0#1, ~to_fp~FLOAT(currentRoundingMode, 16.0)) then 1bv32 else 0bv32)); {438#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:49,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {467#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == ~cond); {471#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume true; {471#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,075 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {471#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} {442#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (= currentRoundingMode roundNearestTiesToEven))} #57#return; {478#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {478#(and (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~Y~0#1|) (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~X~0#1, main_~S~0#1); {482#(and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~S~0#1|) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#(and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~S~0#1|) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.leq~FLOAT(main_~R~0#1, ~fp.neg~FLOAT(main_~D~0#1)); {482#(and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~S~0#1|) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#(and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~S~0#1|) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~FLOAT(main_~R~0#1, main_~D~0#1);main_~Y~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~S~0#1, main_~D~0#1); {489#(and (exists ((|ULTIMATE.start_main_~D~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= |ULTIMATE.start_main_~Y~0#1| (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~D~0#1|)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:49,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {489#(and (exists ((|ULTIMATE.start_main_~D~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~D~0#1| (_ +zero 8 24)) (= |ULTIMATE.start_main_~Y~0#1| (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~D~0#1|)) (fp.leq |ULTIMATE.start_main_~D~0#1| ((_ to_fp 8 24) currentRoundingMode 16.0)))) (= currentRoundingMode roundNearestTiesToEven))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~Y~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 129.0))) && ~fp.leq~FLOAT(main_~Y~0#1, ~to_fp~FLOAT(currentRoundingMode, 129.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {493#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 16:24:49,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {493#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {434#false} is VALID [2022-02-20 16:24:49,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {434#false} assume !false; {434#false} is VALID [2022-02-20 16:24:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:24:49,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:24:49,082 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:49,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782493712] [2022-02-20 16:24:49,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782493712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:49,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:49,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:24:49,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20310790] [2022-02-20 16:24:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 16:24:49,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:49,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:49,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:49,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:24:49,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:24:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:24:49,121 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:51,784 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-02-20 16:24:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:24:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 16:24:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-02-20 16:24:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-02-20 16:24:51,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2022-02-20 16:24:51,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:51,917 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:24:51,918 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 16:24:51,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:24:51,919 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:51,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 90 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 29 Unchecked, 1.3s Time] [2022-02-20 16:24:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 16:24:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 30. [2022-02-20 16:24:51,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:51,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:51,924 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:51,924 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:51,927 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-02-20 16:24:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 16:24:51,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:51,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:51,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-02-20 16:24:51,934 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-02-20 16:24:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:51,937 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-02-20 16:24:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 16:24:51,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:51,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:51,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:51,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:24:51,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 19 [2022-02-20 16:24:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:51,940 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:24:51,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:24:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:24:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:24:51,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:51,941 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:51,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:24:52,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:24:52,150 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1173833260, now seen corresponding path program 1 times [2022-02-20 16:24:52,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:52,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398105831] [2022-02-20 16:24:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:52,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:52,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:52,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:24:52,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:24:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:52,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:24:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:52,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:52,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {707#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); {707#true} is VALID [2022-02-20 16:24:52,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post4#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(currentRoundingMode, 0bv32);main_~i~0#1 := 0bv32; {707#true} is VALID [2022-02-20 16:24:52,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume !!~bvslt32(main_~i~0#1, 100000bv32);main_~X~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {707#true} is VALID [2022-02-20 16:24:52,377 INFO L272 TraceCheckUtils]: 3: Hoare triple {707#true} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~X~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 128.0))) && ~fp.leq~FLOAT(main_~X~0#1, ~to_fp~FLOAT(currentRoundingMode, 128.0)) then 1bv32 else 0bv32)); {707#true} is VALID [2022-02-20 16:24:52,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {707#true} ~cond := #in~cond; {724#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 16:24:52,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:24:52,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:24:52,380 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {707#true} #55#return; {735#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))))} is VALID [2022-02-20 16:24:52,381 INFO L272 TraceCheckUtils]: 8: Hoare triple {735#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))))} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~D~0#1, ~Pluszero~FLOAT()) && ~fp.leq~FLOAT(main_~D~0#1, ~to_fp~FLOAT(currentRoundingMode, 16.0)) then 1bv32 else 0bv32)); {707#true} is VALID [2022-02-20 16:24:52,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-02-20 16:24:52,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#true} assume !(0bv32 == ~cond); {707#true} is VALID [2022-02-20 16:24:52,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} assume true; {707#true} is VALID [2022-02-20 16:24:52,382 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {707#true} {735#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))))} #57#return; {735#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))))} is VALID [2022-02-20 16:24:52,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))))} main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~X~0#1, main_~S~0#1); {754#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)))} is VALID [2022-02-20 16:24:52,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)))} assume !~fp.leq~FLOAT(main_~R~0#1, ~fp.neg~FLOAT(main_~D~0#1)); {754#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)))} is VALID [2022-02-20 16:24:52,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)))} assume !~fp.geq~FLOAT(main_~R~0#1, main_~D~0#1); {754#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)))} is VALID [2022-02-20 16:24:52,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 128.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 128.0)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~Y~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 129.0))) && ~fp.leq~FLOAT(main_~Y~0#1, ~to_fp~FLOAT(currentRoundingMode, 129.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {764#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 16:24:52,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {764#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {708#false} is VALID [2022-02-20 16:24:52,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-02-20 16:24:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:24:52,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:24:52,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-02-20 16:24:52,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond#1; {708#false} is VALID [2022-02-20 16:24:52,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~Y~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 129.0))) && ~fp.leq~FLOAT(main_~Y~0#1, ~to_fp~FLOAT(currentRoundingMode, 129.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {774#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))} is VALID [2022-02-20 16:24:52,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {778#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)))} assume !~fp.geq~FLOAT(main_~R~0#1, main_~D~0#1); {778#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)))} is VALID [2022-02-20 16:24:52,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)))} assume !~fp.leq~FLOAT(main_~R~0#1, ~fp.neg~FLOAT(main_~D~0#1)); {778#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)))} is VALID [2022-02-20 16:24:52,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))))} main_~S~0#1 := main_~Y~0#1;main_~Y~0#1 := main_~X~0#1;main_~R~0#1 := ~fp.sub~FLOAT(currentRoundingMode, main_~X~0#1, main_~S~0#1); {778#(and (fp.geq |ULTIMATE.start_main_~Y~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))) (fp.leq |ULTIMATE.start_main_~Y~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)))} is VALID [2022-02-20 16:24:52,661 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {707#true} {788#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))))} #57#return; {788#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))))} is VALID [2022-02-20 16:24:52,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} assume true; {707#true} is VALID [2022-02-20 16:24:52,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#true} assume !(0bv32 == ~cond); {707#true} is VALID [2022-02-20 16:24:52,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-02-20 16:24:52,662 INFO L272 TraceCheckUtils]: 8: Hoare triple {788#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))))} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~D~0#1, ~Pluszero~FLOAT()) && ~fp.leq~FLOAT(main_~D~0#1, ~to_fp~FLOAT(currentRoundingMode, 16.0)) then 1bv32 else 0bv32)); {707#true} is VALID [2022-02-20 16:24:52,664 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {707#true} #55#return; {788#(and (fp.leq |ULTIMATE.start_main_~X~0#1| ((_ to_fp 8 24) currentRoundingMode 129.0)) (fp.geq |ULTIMATE.start_main_~X~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 129.0))))} is VALID [2022-02-20 16:24:52,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:24:52,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == ~cond); {728#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:24:52,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {707#true} ~cond := #in~cond; {816#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2022-02-20 16:24:52,665 INFO L272 TraceCheckUtils]: 3: Hoare triple {707#true} call assume_abort_if_not((if ~fp.geq~FLOAT(main_~X~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 128.0))) && ~fp.leq~FLOAT(main_~X~0#1, ~to_fp~FLOAT(currentRoundingMode, 128.0)) then 1bv32 else 0bv32)); {707#true} is VALID [2022-02-20 16:24:52,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume !!~bvslt32(main_~i~0#1, 100000bv32);main_~X~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~D~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {707#true} is VALID [2022-02-20 16:24:52,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post4#1, main_~X~0#1, main_~Y~0#1, main_~S~0#1, main_~R~0#1, main_~D~0#1, main_~i~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~S~0#1;havoc main_~R~0#1;havoc main_~D~0#1;havoc main_~i~0#1;main_~Y~0#1 := ~convertINTToFLOAT(currentRoundingMode, 0bv32);main_~i~0#1 := 0bv32; {707#true} is VALID [2022-02-20 16:24:52,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {707#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); {707#true} is VALID [2022-02-20 16:24:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:24:52,667 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:52,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398105831] [2022-02-20 16:24:52,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398105831] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:24:52,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:24:52,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 16:24:52,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236624586] [2022-02-20 16:24:52,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:24:52,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-02-20 16:24:52,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:52,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:24:52,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:52,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:24:52,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:24:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:24:52,716 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:24:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:58,085 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-20 16:24:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 16:24:58,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-02-20 16:24:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:24:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-02-20 16:24:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:24:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-02-20 16:24:58,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2022-02-20 16:24:58,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:58,230 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:24:58,230 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:24:58,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-02-20 16:24:58,232 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:58,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 125 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 16:24:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:24:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2022-02-20 16:24:58,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:58,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:58,235 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:58,235 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:58,237 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 16:24:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 16:24:58,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:58,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:58,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-20 16:24:58,238 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-20 16:24:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:58,241 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 16:24:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 16:24:58,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:58,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:58,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:58,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:24:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:24:58,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 19 [2022-02-20 16:24:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:58,244 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:24:58,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:24:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:24:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:24:58,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:58,255 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:58,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 16:24:58,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:24:58,463 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1809540222, now seen corresponding path program 1 times [2022-02-20 16:24:58,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:58,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600659734] [2022-02-20 16:24:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:58,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:58,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:58,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:24:58,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:24:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:58,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:24:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:25:37,733 WARN L228 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)