./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.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 afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:52:42,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:52:42,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:52:42,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:52:42,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:52:42,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:52:42,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:52:42,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:52:42,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:52:42,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:52:42,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:52:42,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:52:42,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:52:42,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:52:42,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:52:42,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:52:42,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:52:42,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:52:42,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:52:42,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:52:42,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:52:42,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:52:42,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:52:42,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:52:42,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:52:42,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:52:42,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:52:42,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:52:42,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:52:42,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:52:42,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:52:42,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:52:42,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:52:42,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:52:42,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:52:42,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:52:42,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:52:42,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:52:42,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:52:42,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:52:42,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:52:42,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:52:42,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 13:52:42,384 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:52:42,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:52:42,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:52:42,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:52:42,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:52:42,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:52:42,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:52:42,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:52:42,390 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:52:42,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:52:42,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:52:42,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 13:52:42,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:52:42,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:52:42,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:52:42,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:52:42,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:52:42,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:52:42,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:52:42,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:52:42,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:52:42,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:52:42,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:52:42,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:52:42,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:52:42,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:52:42,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:52:42,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:52:42,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 13:52:42,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 13:52:42,396 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:52:42,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:52:42,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:52:42,396 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 -> afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 [2022-07-19 13:52:42,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:52:42,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:52:42,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:52:42,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:52:42,670 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:52:42,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2022-07-19 13:52:42,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63af3fa5/75b335ea0ace4f98826cb6acda796a0b/FLAG5d839abae [2022-07-19 13:52:43,080 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:52:43,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2022-07-19 13:52:43,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63af3fa5/75b335ea0ace4f98826cb6acda796a0b/FLAG5d839abae [2022-07-19 13:52:43,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63af3fa5/75b335ea0ace4f98826cb6acda796a0b [2022-07-19 13:52:43,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:52:43,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:52:43,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:52:43,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:52:43,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:52:43,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc4e29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43, skipping insertion in model container [2022-07-19 13:52:43,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:52:43,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:52:43,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2022-07-19 13:52:43,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:52:43,691 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:52:43,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2022-07-19 13:52:43,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:52:43,720 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:52:43,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43 WrapperNode [2022-07-19 13:52:43,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:52:43,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:52:43,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:52:43,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:52:43,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,749 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2022-07-19 13:52:43,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:52:43,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:52:43,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:52:43,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:52:43,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:52:43,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:52:43,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:52:43,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:52:43,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (1/1) ... [2022-07-19 13:52:43,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:52:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:52:43,805 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-07-19 13:52:43,822 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-07-19 13:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:52:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:52:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 13:52:43,896 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:52:43,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:52:43,974 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:52:43,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:52:43,979 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:52:43,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:52:43 BoogieIcfgContainer [2022-07-19 13:52:43,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:52:43,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:52:43,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:52:43,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:52:43,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:52:43" (1/3) ... [2022-07-19 13:52:43,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77179a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:52:43, skipping insertion in model container [2022-07-19 13:52:43,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:43" (2/3) ... [2022-07-19 13:52:43,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77179a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:52:43, skipping insertion in model container [2022-07-19 13:52:43,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:52:43" (3/3) ... [2022-07-19 13:52:43,987 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2022-07-19 13:52:43,999 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:52:44,001 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:52:44,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:52:44,051 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cd6a94d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46e9214f [2022-07-19 13:52:44,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:52:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:52:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-19 13:52:44,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:52:44,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-19 13:52:44,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:52:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:52:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-07-19 13:52:44,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:52:44,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446728212] [2022-07-19 13:52:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:52:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:52:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:52:44,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 13:52:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:52:44,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 13:52:44,193 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 13:52:44,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 13:52:44,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 13:52:44,200 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-19 13:52:44,203 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:52:44,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:52:44 BoogieIcfgContainer [2022-07-19 13:52:44,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:52:44,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:52:44,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:52:44,225 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:52:44,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:52:43" (3/4) ... [2022-07-19 13:52:44,228 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 13:52:44,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:52:44,229 INFO L158 Benchmark]: Toolchain (without parser) took 712.16ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 64.6MB in the beginning and 75.8MB in the end (delta: -11.3MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-07-19 13:52:44,229 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:52:44,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.82ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 64.3MB in the beginning and 101.0MB in the end (delta: -36.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:52:44,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.68ms. Allocated memory is still 123.7MB. Free memory was 101.0MB in the beginning and 99.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:52:44,236 INFO L158 Benchmark]: Boogie Preprocessor took 19.24ms. Allocated memory is still 123.7MB. Free memory was 99.1MB in the beginning and 98.2MB in the end (delta: 866.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:52:44,236 INFO L158 Benchmark]: RCFGBuilder took 210.28ms. Allocated memory is still 123.7MB. Free memory was 98.2MB in the beginning and 89.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:52:44,237 INFO L158 Benchmark]: TraceAbstraction took 240.16ms. Allocated memory is still 123.7MB. Free memory was 89.0MB in the beginning and 76.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 13:52:44,237 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 123.7MB. Free memory was 76.3MB in the beginning and 75.8MB in the end (delta: 450.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:52:44,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.82ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 64.3MB in the beginning and 101.0MB in the end (delta: -36.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.68ms. Allocated memory is still 123.7MB. Free memory was 101.0MB in the beginning and 99.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.24ms. Allocated memory is still 123.7MB. Free memory was 99.1MB in the beginning and 98.2MB in the end (delta: 866.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 210.28ms. Allocated memory is still 123.7MB. Free memory was 98.2MB in the beginning and 89.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 240.16ms. Allocated memory is still 123.7MB. Free memory was 89.0MB in the beginning and 76.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 123.7MB. Free memory was 76.3MB in the beginning and 75.8MB in the end (delta: 450.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 2.5; VAL [__return_main=0, main__x=1] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L27] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 13:52:44,269 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 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.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 afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:52:46,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:52:46,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:52:46,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:52:46,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:52:46,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:52:46,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:52:46,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:52:46,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:52:46,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:52:46,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:52:46,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:52:46,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:52:46,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:52:46,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:52:46,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:52:46,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:52:46,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:52:46,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:52:46,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:52:46,205 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:52:46,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:52:46,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:52:46,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:52:46,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:52:46,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:52:46,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:52:46,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:52:46,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:52:46,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:52:46,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:52:46,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:52:46,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:52:46,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:52:46,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:52:46,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:52:46,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:52:46,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:52:46,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:52:46,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:52:46,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:52:46,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:52:46,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 13:52:46,271 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:52:46,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:52:46,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:52:46,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:52:46,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:52:46,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:52:46,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:52:46,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:52:46,274 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:52:46,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:52:46,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:52:46,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:52:46,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:52:46,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:52:46,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:52:46,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:52:46,276 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 13:52:46,277 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 13:52:46,277 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 13:52:46,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:52:46,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:52:46,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:52:46,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:52:46,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:52:46,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:52:46,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:52:46,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:52:46,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:52:46,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:52:46,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:52:46,279 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 13:52:46,280 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 13:52:46,280 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:52:46,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:52:46,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:52:46,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 13:52:46,281 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 -> afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 [2022-07-19 13:52:46,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:52:46,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:52:46,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:52:46,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:52:46,581 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:52:46,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2022-07-19 13:52:46,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4279aa/82788fe818b14ead834ece2aff4b4a91/FLAGaf430a9eb [2022-07-19 13:52:47,050 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:52:47,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2022-07-19 13:52:47,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4279aa/82788fe818b14ead834ece2aff4b4a91/FLAGaf430a9eb [2022-07-19 13:52:47,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4279aa/82788fe818b14ead834ece2aff4b4a91 [2022-07-19 13:52:47,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:52:47,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:52:47,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:52:47,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:52:47,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:52:47,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bad19d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47, skipping insertion in model container [2022-07-19 13:52:47,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:52:47,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:52:47,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2022-07-19 13:52:47,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:52:47,283 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:52:47,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2022-07-19 13:52:47,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:52:47,354 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:52:47,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47 WrapperNode [2022-07-19 13:52:47,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:52:47,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:52:47,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:52:47,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:52:47,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,382 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-07-19 13:52:47,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:52:47,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:52:47,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:52:47,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:52:47,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:52:47,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:52:47,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:52:47,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:52:47,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (1/1) ... [2022-07-19 13:52:47,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:52:47,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:52:47,461 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-07-19 13:52:47,481 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-07-19 13:52:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:52:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:52:47,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:52:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 13:52:47,550 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:52:47,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:52:51,302 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:52:51,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:52:51,307 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:52:51,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:52:51 BoogieIcfgContainer [2022-07-19 13:52:51,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:52:51,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:52:51,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:52:51,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:52:51,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:52:47" (1/3) ... [2022-07-19 13:52:51,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e51c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:52:51, skipping insertion in model container [2022-07-19 13:52:51,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:52:47" (2/3) ... [2022-07-19 13:52:51,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e51c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:52:51, skipping insertion in model container [2022-07-19 13:52:51,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:52:51" (3/3) ... [2022-07-19 13:52:51,317 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2022-07-19 13:52:51,328 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:52:51,329 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:52:51,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:52:51,403 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74facb37, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a52ab9 [2022-07-19 13:52:51,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:52:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:52:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-19 13:52:51,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:52:51,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-19 13:52:51,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:52:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:52:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-07-19 13:52:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:52:51,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584958090] [2022-07-19 13:52:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:52:51,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:52:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:52:51,485 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-07-19 13:52:51,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 13:52:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:52:51,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 13:52:51,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:52:58,430 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2022-07-19 13:52:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:52:58,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:52:58,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:52:58,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584958090] [2022-07-19 13:52:58,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584958090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:52:58,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:52:58,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:52:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448129366] [2022-07-19 13:52:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:52:58,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 13:52:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:52:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 13:52:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2022-07-19 13:52:58,481 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:53:00,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:53:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:53:01,010 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-19 13:53:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 13:53:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-19 13:53:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:53:01,022 INFO L225 Difference]: With dead ends: 16 [2022-07-19 13:53:01,022 INFO L226 Difference]: Without dead ends: 7 [2022-07-19 13:53:01,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2022-07-19 13:53:01,028 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 13:53:01,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 8 Unchecked, 2.5s Time] [2022-07-19 13:53:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-07-19 13:53:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-19 13:53:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:53:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-07-19 13:53:01,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-07-19 13:53:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:53:01,060 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-07-19 13:53:01,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:53:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-07-19 13:53:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 13:53:01,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:53:01,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 13:53:01,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 13:53:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:53:01,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:53:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:53:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-07-19 13:53:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:53:01,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867667349] [2022-07-19 13:53:01,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:53:01,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:53:01,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:53:01,282 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-07-19 13:53:01,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 13:53:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:53:01,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 13:53:01,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:53:08,592 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2022-07-19 13:53:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 13:53:08,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:53:15,054 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2022-07-19 13:53:23,113 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2022-07-19 13:53:25,252 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2022-07-19 13:53:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 13:53:25,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:53:25,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867667349] [2022-07-19 13:53:25,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867667349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:53:25,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:53:25,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-19 13:53:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729820030] [2022-07-19 13:53:25,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:53:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 13:53:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:53:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 13:53:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=14, Unknown=4, NotChecked=24, Total=56 [2022-07-19 13:53:25,256 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:53:27,414 WARN L855 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:53:29,566 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:53:31,718 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)))) is different from true [2022-07-19 13:53:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:53:31,734 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-07-19 13:53:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 13:53:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-19 13:53:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:53:31,736 INFO L225 Difference]: With dead ends: 11 [2022-07-19 13:53:31,736 INFO L226 Difference]: Without dead ends: 8 [2022-07-19 13:53:31,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=20, Invalid=17, Unknown=7, NotChecked=66, Total=110 [2022-07-19 13:53:31,737 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:53:31,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-19 13:53:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-19 13:53:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-19 13:53:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:53:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-07-19 13:53:31,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-07-19 13:53:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:53:31,741 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-07-19 13:53:31,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:53:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-07-19 13:53:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 13:53:31,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:53:31,742 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-07-19 13:53:31,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 13:53:31,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:53:31,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:53:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:53:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2022-07-19 13:53:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:53:31,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361725875] [2022-07-19 13:53:31,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 13:53:31,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:53:31,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:53:31,959 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-07-19 13:53:31,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 13:53:32,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 13:53:32,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:53:32,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 13:53:32,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:53:38,756 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:53:47,529 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:53:49,800 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:53:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-19 13:53:49,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:54:00,348 WARN L833 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:54:02,482 WARN L855 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:54:12,279 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:54:14,554 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-19 13:54:16,826 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-19 13:54:26,657 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:54:28,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2022-07-19 13:54:31,187 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2022-07-19 13:54:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-19 13:54:31,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:54:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361725875] [2022-07-19 13:54:31,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361725875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:54:31,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:54:31,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-07-19 13:54:31,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125043274] [2022-07-19 13:54:31,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:54:31,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 13:54:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:54:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 13:54:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2022-07-19 13:54:31,190 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:33,493 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:54:35,793 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:54:38,087 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:54:40,388 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:54:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:54:40,433 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-07-19 13:54:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 13:54:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-19 13:54:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:54:40,434 INFO L225 Difference]: With dead ends: 12 [2022-07-19 13:54:40,434 INFO L226 Difference]: Without dead ends: 9 [2022-07-19 13:54:40,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=28, Invalid=26, Unknown=12, NotChecked=144, Total=210 [2022-07-19 13:54:40,436 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:54:40,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-07-19 13:54:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-19 13:54:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-19 13:54:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-19 13:54:40,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-07-19 13:54:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:54:40,439 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-19 13:54:40,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-19 13:54:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 13:54:40,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:54:40,440 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2022-07-19 13:54:40,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 13:54:40,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:54:40,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:54:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:54:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2022-07-19 13:54:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:54:40,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114339533] [2022-07-19 13:54:40,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 13:54:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:54:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:54:40,644 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-07-19 13:54:40,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 13:54:41,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 13:54:41,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:54:41,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 13:54:41,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:54:48,450 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:54:53,489 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:54:55,788 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:55:05,884 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:55:08,308 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:55:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-19 13:55:08,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:55:17,815 WARN L833 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:55:19,959 WARN L855 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:55:29,832 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:55:32,126 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-19 13:55:34,437 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-19 13:55:40,025 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:55:45,361 WARN L233 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:55:47,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-19 13:55:50,226 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-19 13:55:55,570 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:56:01,143 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:56:03,558 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2022-07-19 13:56:05,980 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2022-07-19 13:56:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-19 13:56:05,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:56:05,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114339533] [2022-07-19 13:56:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114339533] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:56:05,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:56:05,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-07-19 13:56:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996069030] [2022-07-19 13:56:05,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:56:05,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 13:56:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:56:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 13:56:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=23, Unknown=11, NotChecked=98, Total=156 [2022-07-19 13:56:05,982 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:56:08,466 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:10,928 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:56:13,381 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:56:15,834 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:56:18,299 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:56:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:56:18,375 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-07-19 13:56:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 13:56:18,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 13:56:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:56:18,377 INFO L225 Difference]: With dead ends: 13 [2022-07-19 13:56:18,377 INFO L226 Difference]: Without dead ends: 10 [2022-07-19 13:56:18,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=34, Invalid=28, Unknown=16, NotChecked=228, Total=306 [2022-07-19 13:56:18,378 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:56:18,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-07-19 13:56:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-19 13:56:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-19 13:56:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:56:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-19 13:56:18,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-07-19 13:56:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:56:18,381 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-19 13:56:18,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:56:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-19 13:56:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-19 13:56:18,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:56:18,382 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-19 13:56:18,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 13:56:18,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:56:18,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:56:18,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:56:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2022-07-19 13:56:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:56:18,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108589279] [2022-07-19 13:56:18,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 13:56:18,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:56:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:56:18,594 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-07-19 13:56:18,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 13:56:19,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 13:56:19,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:56:19,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 13:56:19,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:56:26,266 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:31,337 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:56:33,636 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:39,247 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:56:41,685 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:48,431 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2022-07-19 13:56:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-19 13:56:48,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:56:55,010 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2022-07-19 13:56:57,150 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2022-07-19 13:57:04,008 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2022-07-19 13:57:06,301 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2022-07-19 13:57:13,598 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2022-07-19 13:57:16,038 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2022-07-19 13:57:21,140 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:57:23,706 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2022-07-19 13:57:26,271 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2022-07-19 13:57:31,376 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)