./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Double_div.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/Double_div.i -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 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:27:33,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:27:33,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:27:33,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:27:33,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:27:33,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:27:33,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:27:33,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:27:33,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:27:33,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:27:33,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:27:33,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:27:33,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:27:33,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:27:33,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:27:33,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:27:33,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:27:33,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:27:33,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:27:33,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:27:33,784 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:27:33,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:27:33,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:27:33,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:27:33,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:27:33,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:27:33,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:27:33,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:27:33,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:27:33,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:27:33,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:27:33,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:27:33,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:27:33,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:27:33,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:27:33,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:27:33,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:27:33,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:27:33,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:27:33,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:27:33,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:27:33,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:27:33,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:27:33,840 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:27:33,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:27:33,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:27:33,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:27:33,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:27:33,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:27:33,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:27:33,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:27:33,843 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:27:33,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:27:33,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:27:33,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:27:33,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:27:33,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:27:33,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:27:33,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:27:33,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:27:33,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:27:33,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:27:33,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:27:33,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:27:33,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:27:33,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:27:33,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:27:33,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:27:33,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:27:33,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:27:33,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:27:33,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:27:33,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:27:33,848 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:27:33,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:27:33,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:27:33,849 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 -> 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d [2022-07-21 01:27:34,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:27:34,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:27:34,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:27:34,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:27:34,154 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:27:34,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2022-07-21 01:27:34,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb0ca6ff/c6b93a3ffb45443a9df17f1a60cd6b83/FLAG43c9088bf [2022-07-21 01:27:34,627 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:27:34,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2022-07-21 01:27:34,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb0ca6ff/c6b93a3ffb45443a9df17f1a60cd6b83/FLAG43c9088bf [2022-07-21 01:27:34,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb0ca6ff/c6b93a3ffb45443a9df17f1a60cd6b83 [2022-07-21 01:27:34,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:27:34,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:27:34,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:27:34,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:27:34,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:27:34,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4aa437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34, skipping insertion in model container [2022-07-21 01:27:34,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:27:34,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:27:34,840 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/Double_div.i[804,817] [2022-07-21 01:27:34,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:27:34,864 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:27:34,889 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/Double_div.i[804,817] [2022-07-21 01:27:34,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:27:34,914 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:27:34,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34 WrapperNode [2022-07-21 01:27:34,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:27:34,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:27:34,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:27:34,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:27:34,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,949 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-07-21 01:27:34,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:27:34,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:27:34,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:27:34,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:27:34,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:27:34,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:27:34,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:27:34,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:27:34,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (1/1) ... [2022-07-21 01:27:34,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:27:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:27:35,017 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-21 01:27:35,039 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-21 01:27:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:27:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:27:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:27:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:27:35,104 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:27:35,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:27:35,226 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:27:35,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:27:35,231 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:27:35,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:27:35 BoogieIcfgContainer [2022-07-21 01:27:35,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:27:35,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:27:35,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:27:35,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:27:35,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:27:34" (1/3) ... [2022-07-21 01:27:35,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79003013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:27:35, skipping insertion in model container [2022-07-21 01:27:35,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:34" (2/3) ... [2022-07-21 01:27:35,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79003013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:27:35, skipping insertion in model container [2022-07-21 01:27:35,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:27:35" (3/3) ... [2022-07-21 01:27:35,242 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i [2022-07-21 01:27:35,255 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:27:35,255 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:27:35,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:27:35,320 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@3fe4e103, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c5cb829 [2022-07-21 01:27:35,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:27:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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-21 01:27:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 01:27:35,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:27:35,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 01:27:35,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:27:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:27:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-21 01:27:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:27:35,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865399528] [2022-07-21 01:27:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:27:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:27:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:27:35,457 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:27:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:27:35,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:27:35,500 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:27:35,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:27:35,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:27:35,509 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-21 01:27:35,515 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:27:35,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:27:35 BoogieIcfgContainer [2022-07-21 01:27:35,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:27:35,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:27:35,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:27:35,538 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:27:35,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:27:35" (3/4) ... [2022-07-21 01:27:35,541 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:27:35,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:27:35,544 INFO L158 Benchmark]: Toolchain (without parser) took 886.53ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 43.2MB in the end (delta: -8.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-07-21 01:27:35,545 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:27:35,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.50ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 39.3MB in the end (delta: -5.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 01:27:35,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.57ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 38.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:27:35,547 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 37.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:27:35,548 INFO L158 Benchmark]: RCFGBuilder took 252.19ms. Allocated memory is still 56.6MB. Free memory was 37.0MB in the beginning and 28.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 01:27:35,549 INFO L158 Benchmark]: TraceAbstraction took 300.60ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 28.3MB in the beginning and 43.5MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:27:35,550 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 69.2MB. Free memory was 43.5MB in the beginning and 43.2MB in the end (delta: 273.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:27:35,552 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.23ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.50ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 39.3MB in the end (delta: -5.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.57ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 38.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 37.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.19ms. Allocated memory is still 56.6MB. Free memory was 37.0MB in the beginning and 28.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 300.60ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 28.3MB in the beginning and 43.5MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 69.2MB. Free memory was 43.5MB in the beginning and 43.2MB in the end (delta: 273.4kB). Peak memory consumption was 2.1MB. 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 21. Possible FailurePath: [L20] double x = 1.0; [L21] double x1 = x/2.5; VAL [x=1] [L23] COND FALSE !(x1 != x) VAL [x=1] [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 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=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 01:27:35,593 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/Double_div.i -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 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:27:37,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:27:37,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:27:37,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:27:37,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:27:37,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:27:37,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:27:37,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:27:37,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:27:37,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:27:37,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:27:37,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:27:37,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:27:37,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:27:37,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:27:37,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:27:37,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:27:37,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:27:37,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:27:37,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:27:37,679 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:27:37,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:27:37,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:27:37,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:27:37,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:27:37,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:27:37,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:27:37,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:27:37,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:27:37,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:27:37,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:27:37,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:27:37,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:27:37,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:27:37,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:27:37,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:27:37,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:27:37,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:27:37,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:27:37,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:27:37,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:27:37,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:27:37,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:27:37,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:27:37,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:27:37,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:27:37,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:27:37,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:27:37,732 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:27:37,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:27:37,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:27:37,733 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:27:37,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:27:37,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:27:37,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:27:37,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:27:37,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:27:37,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:27:37,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:27:37,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:27:37,736 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:27:37,736 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:27:37,736 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:27:37,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:27:37,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:27:37,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:27:37,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:27:37,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:27:37,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:27:37,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:27:37,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:27:37,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:27:37,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:27:37,739 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:27:37,739 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:27:37,739 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:27:37,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:27:37,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:27:37,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:27:37,740 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 -> 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d [2022-07-21 01:27:38,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:27:38,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:27:38,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:27:38,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:27:38,067 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:27:38,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2022-07-21 01:27:38,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c383ee4e0/2212870fc6ca4ab3b95eef895ebb78ec/FLAGbb841e010 [2022-07-21 01:27:38,589 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:27:38,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2022-07-21 01:27:38,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c383ee4e0/2212870fc6ca4ab3b95eef895ebb78ec/FLAGbb841e010 [2022-07-21 01:27:39,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c383ee4e0/2212870fc6ca4ab3b95eef895ebb78ec [2022-07-21 01:27:39,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:27:39,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:27:39,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:27:39,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:27:39,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:27:39,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7ef2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39, skipping insertion in model container [2022-07-21 01:27:39,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:27:39,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:27:39,148 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/Double_div.i[804,817] [2022-07-21 01:27:39,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:27:39,180 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:27:39,197 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/Double_div.i[804,817] [2022-07-21 01:27:39,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:27:39,249 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:27:39,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39 WrapperNode [2022-07-21 01:27:39,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:27:39,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:27:39,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:27:39,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:27:39,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,285 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-07-21 01:27:39,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:27:39,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:27:39,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:27:39,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:27:39,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:27:39,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:27:39,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:27:39,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:27:39,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (1/1) ... [2022-07-21 01:27:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:27:39,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:27:39,341 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-21 01:27:39,364 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-21 01:27:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:27:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:27:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:27:39,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:27:39,447 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:27:39,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:27:42,701 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:27:42,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:27:42,706 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:27:42,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:27:42 BoogieIcfgContainer [2022-07-21 01:27:42,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:27:42,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:27:42,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:27:42,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:27:42,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:27:39" (1/3) ... [2022-07-21 01:27:42,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ae7122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:27:42, skipping insertion in model container [2022-07-21 01:27:42,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:27:39" (2/3) ... [2022-07-21 01:27:42,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ae7122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:27:42, skipping insertion in model container [2022-07-21 01:27:42,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:27:42" (3/3) ... [2022-07-21 01:27:42,740 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i [2022-07-21 01:27:42,756 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:27:42,763 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:27:42,817 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:27:42,824 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@377eb87f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11b33115 [2022-07-21 01:27:42,825 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:27:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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-21 01:27:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 01:27:42,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:27:42,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 01:27:42,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:27:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:27:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-21 01:27:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:27:42,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931293253] [2022-07-21 01:27:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:27:42,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:27:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:27:42,871 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-21 01:27:42,874 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-21 01:27:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:27:43,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 01:27:43,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:27:51,125 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-21 01:27:51,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:27:51,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:27:51,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931293253] [2022-07-21 01:27:51,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931293253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:27:51,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:27:51,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:27:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495414756] [2022-07-21 01:27:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:27:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:27:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:27:51,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:27:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:27:51,161 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:27:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:27:56,463 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-21 01:27:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:27:56,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 01:27:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:27:56,479 INFO L225 Difference]: With dead ends: 20 [2022-07-21 01:27:56,479 INFO L226 Difference]: Without dead ends: 8 [2022-07-21 01:27:56,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:27:56,488 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:27:56,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 01:27:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-21 01:27:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-21 01:27:56,525 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-21 01:27:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-07-21 01:27:56,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-07-21 01:27:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:27:56,527 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-07-21 01:27:56,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:27:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-07-21 01:27:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:27:56,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:27:56,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:27:56,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 01:27:56,731 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-21 01:27:56,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:27:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:27:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-07-21 01:27:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:27:56,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327360720] [2022-07-21 01:27:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:27:56,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:27:56,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:27:56,735 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-21 01:27:56,736 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-21 01:27:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:27:57,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 01:27:57,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:28:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:28:05,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:28:13,508 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|)) is different from false [2022-07-21 01:28:15,630 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|)) is different from true [2022-07-21 01:28:19,232 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-21 01:28:19,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:28:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327360720] [2022-07-21 01:28:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327360720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:28:19,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:28:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-21 01:28:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790860338] [2022-07-21 01:28:19,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:28:19,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:28:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:28:19,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:28:19,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2022-07-21 01:28:19,236 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:28:29,216 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 17 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:28:30,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:28:35,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:28:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:28:36,874 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-07-21 01:28:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:28:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 01:28:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:28:36,876 INFO L225 Difference]: With dead ends: 14 [2022-07-21 01:28:36,876 INFO L226 Difference]: Without dead ends: 10 [2022-07-21 01:28:36,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=29, Invalid=45, Unknown=2, NotChecked=14, Total=90 [2022-07-21 01:28:36,878 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:28:36,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 7 Unchecked, 5.0s Time] [2022-07-21 01:28:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-21 01:28:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-21 01:28:36,881 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-21 01:28:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-21 01:28:36,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2022-07-21 01:28:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:28:36,882 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-21 01:28:36,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:28:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-21 01:28:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:28:36,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:28:36,883 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-07-21 01:28:36,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:28:37,087 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-21 01:28:37,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:28:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:28:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 2 times [2022-07-21 01:28:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:28:37,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461711137] [2022-07-21 01:28:37,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:28:37,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:28:37,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:28:37,093 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-21 01:28:37,095 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-21 01:28:37,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:28:37,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:28:37,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:28:37,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:28:42,220 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:28:50,196 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:28:57,824 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:28:59,952 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:28:59,983 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-21 01:28:59,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:29:11,033 WARN L855 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-21 01:29:22,894 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-07-21 01:29:25,134 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-07-21 01:29:30,547 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:29:35,772 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:29:38,145 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:29:40,520 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:29:45,972 WARN L233 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:29:51,206 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:29:53,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-07-21 01:29:55,941 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-07-21 01:29:55,942 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-21 01:29:55,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:29:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461711137] [2022-07-21 01:29:55,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461711137] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:29:55,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:29:55,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2022-07-21 01:29:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639872543] [2022-07-21 01:29:55,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:29:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 01:29:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:29:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 01:29:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=33, Unknown=10, NotChecked=112, Total=182 [2022-07-21 01:29:55,944 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-21 01:29:58,366 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:30:00,786 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:03,084 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:05,236 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:07,386 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:30:07,497 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-07-21 01:30:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:30:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 9 [2022-07-21 01:30:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:30:07,498 INFO L225 Difference]: With dead ends: 15 [2022-07-21 01:30:07,499 INFO L226 Difference]: Without dead ends: 11 [2022-07-21 01:30:07,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=37, Invalid=38, Unknown=15, NotChecked=252, Total=342 [2022-07-21 01:30:07,500 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:30:07,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-07-21 01:30:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-21 01:30:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-21 01:30:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:30:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-21 01:30:07,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-21 01:30:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:30:07,505 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-21 01:30:07,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-21 01:30:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-21 01:30:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:30:07,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:30:07,506 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-21 01:30:07,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 01:30:07,711 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-21 01:30:07,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:30:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:30:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 3 times [2022-07-21 01:30:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:30:07,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764197262] [2022-07-21 01:30:07,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 01:30:07,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:30:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:30:07,720 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-21 01:30:07,724 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-21 01:30:08,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 01:30:08,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:30:08,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 01:30:08,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:30:12,922 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:30:20,928 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:30:26,410 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:30:41,126 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:30:50,194 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:30:53,860 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-21 01:30:58,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:31:08,017 WARN L833 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-21 01:31:21,916 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-07-21 01:31:24,156 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-07-21 01:31:29,626 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:34,832 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:37,233 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:31:39,623 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:31:46,026 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:51,947 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:54,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-07-21 01:31:57,161 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-07-21 01:32:02,843 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:32:08,770 WARN L233 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:32:11,296 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:32:13,817 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:32:13,817 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-21 01:32:13,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:32:13,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764197262] [2022-07-21 01:32:13,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764197262] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:32:13,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:32:13,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2022-07-21 01:32:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405687006] [2022-07-21 01:32:13,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:32:13,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 01:32:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:32:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 01:32:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=42, Unknown=14, NotChecked=152, Total=240 [2022-07-21 01:32:13,819 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-21 01:32:16,439 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:32:19,102 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:32:21,995 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true