./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:21:44,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:44,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:44,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:44,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:44,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:44,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:44,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:44,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:44,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:44,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:44,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:44,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:44,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:44,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:44,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:44,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:44,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:44,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:44,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:44,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:44,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:44,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:44,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:44,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:44,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:44,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:44,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:44,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:44,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:44,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:44,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:44,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:44,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:44,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:44,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:44,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:44,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:44,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:44,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:44,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:44,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:21:44,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:44,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:44,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:44,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:44,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:44,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:44,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:44,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:44,786 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:44,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:44,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:44,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:44,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:44,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:44,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:44,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:44,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:44,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:44,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:44,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:44,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:44,790 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2022-02-20 16:21:44,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:45,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:45,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:45,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:45,012 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:45,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-02-20 16:21:45,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2af53cf/016bb8cf50dc411ca8f5fec216a5d47a/FLAG75952e71c [2022-02-20 16:21:45,354 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:45,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-02-20 16:21:45,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2af53cf/016bb8cf50dc411ca8f5fec216a5d47a/FLAG75952e71c [2022-02-20 16:21:45,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2af53cf/016bb8cf50dc411ca8f5fec216a5d47a [2022-02-20 16:21:45,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:45,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:45,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:45,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:45,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:45,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:45,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38756ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45, skipping insertion in model container [2022-02-20 16:21:45,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:45,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:45,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:45,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-02-20 16:21:45,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:45,961 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:45,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-02-20 16:21:45,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:45,992 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:45,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45 WrapperNode [2022-02-20 16:21:45,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:45,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:45,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:45,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:46,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,026 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-02-20 16:21:46,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:46,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:46,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:46,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:46,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:46,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:46,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:46,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:46,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (1/1) ... [2022-02-20 16:21:46,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:46,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:21:46,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:21:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:21:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:46,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:46,159 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:46,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:46,295 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:46,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:46,299 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:46,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:46 BoogieIcfgContainer [2022-02-20 16:21:46,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:46,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:46,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:46,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:46,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:45" (1/3) ... [2022-02-20 16:21:46,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434a339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:46, skipping insertion in model container [2022-02-20 16:21:46,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:45" (2/3) ... [2022-02-20 16:21:46,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434a339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:46, skipping insertion in model container [2022-02-20 16:21:46,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:46" (3/3) ... [2022-02-20 16:21:46,310 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-02-20 16:21:46,314 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:46,314 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:21:46,343 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:46,348 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:46,348 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:21:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:46,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:46,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:46,362 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2022-02-20 16:21:46,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:46,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213952168] [2022-02-20 16:21:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:46,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {22#true} is VALID [2022-02-20 16:21:46,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(0);main_~main__S~0#1 := ~convertINTToDOUBLE(0);main_~main__i~0#1 := 0; {22#true} is VALID [2022-02-20 16:21:46,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume main_~main__i~0#1 <= 1000000;main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {22#true} is VALID [2022-02-20 16:21:46,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume !~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, ~someUnaryDOUBLEoperation(1.0)); {22#true} is VALID [2022-02-20 16:21:46,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#true} main_~main____CPAchecker_TMP_0~0#1 := 0; {24#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 0)} is VALID [2022-02-20 16:21:46,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 0)} assume 0 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {23#false} is VALID [2022-02-20 16:21:46,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume !(0 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(0); {23#false} is VALID [2022-02-20 16:21:46,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {23#false} is VALID [2022-02-20 16:21:46,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, ~someUnaryDOUBLEoperation(10000.0)); {23#false} is VALID [2022-02-20 16:21:46,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, 10000.0);main_~main____CPAchecker_TMP_2~0#1 := 1; {23#false} is VALID [2022-02-20 16:21:46,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {23#false} is VALID [2022-02-20 16:21:46,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {23#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {23#false} is VALID [2022-02-20 16:21:46,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 16:21:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:46,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:46,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213952168] [2022-02-20 16:21:46,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213952168] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:46,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:46,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:21:46,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472168394] [2022-02-20 16:21:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:46,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:46,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:46,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:21:46,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:21:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:46,571 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:46,636 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:21:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:21:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:21:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:21:46,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 16:21:46,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:46,725 INFO L225 Difference]: With dead ends: 40 [2022-02-20 16:21:46,725 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:21:46,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:46,742 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:46,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:21:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:21:46,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:46,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,763 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,764 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:46,766 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-20 16:21:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-20 16:21:46,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:46,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:46,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 15 states. [2022-02-20 16:21:46,768 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 15 states. [2022-02-20 16:21:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:46,771 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-20 16:21:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-20 16:21:46,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:46,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:46,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:46,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-02-20 16:21:46,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2022-02-20 16:21:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:46,775 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-20 16:21:46,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-20 16:21:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:46,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:46,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:46,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:21:46,778 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2022-02-20 16:21:46,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:46,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20771874] [2022-02-20 16:21:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:46,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:46,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {133#true} is VALID [2022-02-20 16:21:46,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(0);main_~main__S~0#1 := ~convertINTToDOUBLE(0);main_~main__i~0#1 := 0; {133#true} is VALID [2022-02-20 16:21:46,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} assume main_~main__i~0#1 <= 1000000;main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {133#true} is VALID [2022-02-20 16:21:46,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, ~someUnaryDOUBLEoperation(1.0)); {133#true} is VALID [2022-02-20 16:21:46,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, 1.0);main_~main____CPAchecker_TMP_0~0#1 := 1; {135#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)} is VALID [2022-02-20 16:21:46,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)} assume 0 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {133#true} is VALID [2022-02-20 16:21:46,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(0); {133#true} is VALID [2022-02-20 16:21:46,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {133#true} is VALID [2022-02-20 16:21:46,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, ~someUnaryDOUBLEoperation(10000.0)); {133#true} is VALID [2022-02-20 16:21:46,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, 10000.0);main_~main____CPAchecker_TMP_2~0#1 := 1; {136#(not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 0))} is VALID [2022-02-20 16:21:46,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#(not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 0))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {137#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 16:21:46,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {134#false} is VALID [2022-02-20 16:21:46,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#false} assume !false; {134#false} is VALID [2022-02-20 16:21:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:46,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:46,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20771874] [2022-02-20 16:21:46,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20771874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:46,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:46,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:21:46,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919897506] [2022-02-20 16:21:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:46,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:46,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:46,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:46,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:21:46,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:46,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:21:46,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:21:46,869 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:46,966 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-02-20 16:21:46,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:21:46,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 16:21:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 16:21:46,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-02-20 16:21:47,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:47,034 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:21:47,035 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:21:47,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:21:47,036 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:47,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:21:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2022-02-20 16:21:47,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:47,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:47,040 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:47,040 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:47,041 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 16:21:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:21:47,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:47,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:47,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 34 states. [2022-02-20 16:21:47,042 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 34 states. [2022-02-20 16:21:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:47,044 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 16:21:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:21:47,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:47,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:47,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:47,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 16:21:47,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-02-20 16:21:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:47,046 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 16:21:47,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:21:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:47,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:47,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:47,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:21:47,047 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2022-02-20 16:21:47,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:47,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141627869] [2022-02-20 16:21:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:47,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:21:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:47,086 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:21:47,087 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:21:47,088 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:21:47,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:21:47,091 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:21:47,092 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:21:47,107 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:21:47,107 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:21:47,107 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:21:47,107 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:21:47,107 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:21:47,108 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:21:47,109 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:21:47,110 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:21:47,110 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:21:47,110 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:21:47,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:21:47 BoogieIcfgContainer [2022-02-20 16:21:47,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:21:47,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:21:47,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:21:47,127 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:21:47,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:46" (3/4) ... [2022-02-20 16:21:47,129 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:21:47,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:21:47,130 INFO L158 Benchmark]: Toolchain (without parser) took 1331.30ms. Allocated memory is still 102.8MB. Free memory was 67.0MB in the beginning and 49.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-20 16:21:47,131 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 83.0MB in the beginning and 82.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:47,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.57ms. Allocated memory is still 102.8MB. Free memory was 66.8MB in the beginning and 78.7MB in the end (delta: -11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:21:47,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.17ms. Allocated memory is still 102.8MB. Free memory was 78.7MB in the beginning and 77.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:47,132 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 76.2MB in the end (delta: 747.7kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:21:47,132 INFO L158 Benchmark]: RCFGBuilder took 246.14ms. Allocated memory is still 102.8MB. Free memory was 75.8MB in the beginning and 66.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:21:47,132 INFO L158 Benchmark]: TraceAbstraction took 808.90ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 50.2MB in the end (delta: 15.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-02-20 16:21:47,132 INFO L158 Benchmark]: Witness Printer took 18.54ms. Allocated memory is still 102.8MB. Free memory was 50.2MB in the beginning and 49.7MB in the end (delta: 514.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:47,134 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 83.0MB in the beginning and 82.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.57ms. Allocated memory is still 102.8MB. Free memory was 66.8MB in the beginning and 78.7MB in the end (delta: -11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.17ms. Allocated memory is still 102.8MB. Free memory was 78.7MB in the beginning and 77.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 76.2MB in the end (delta: 747.7kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 246.14ms. Allocated memory is still 102.8MB. Free memory was 75.8MB in the beginning and 66.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 808.90ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 50.2MB in the end (delta: 15.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Witness Printer took 18.54ms. Allocated memory is still 102.8MB. Free memory was 50.2MB in the beginning and 49.7MB in the end (delta: 514.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 56]: 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 43, overapproximation of to_real at line 39. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__E0=49, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=49, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__i=0] [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L56] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 52 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:21:47,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:21:48,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:48,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:48,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:48,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:48,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:48,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:48,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:48,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:48,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:48,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:48,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:48,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:48,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:48,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:48,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:48,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:48,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:48,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:48,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:48,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:48,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:48,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:48,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:48,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:48,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:48,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:48,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:48,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:48,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:48,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:48,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:48,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:48,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:48,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:48,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:48,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:48,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:48,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:48,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:48,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:48,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:21:48,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:48,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:48,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:48,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:48,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:48,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:48,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:48,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:48,906 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:48,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:48,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:48,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:21:48,908 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:48,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:48,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:48,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:48,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:48,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:48,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:48,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:48,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:48,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:48,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:48,910 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:21:48,910 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:21:48,910 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:48,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:48,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:48,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:21:48,911 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2022-02-20 16:21:49,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:49,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:49,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:49,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:49,182 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:49,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-02-20 16:21:49,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe65ebfb/ddf87f026a9448d280fe33929695df37/FLAG8dc49cb97 [2022-02-20 16:21:49,579 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:49,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-02-20 16:21:49,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe65ebfb/ddf87f026a9448d280fe33929695df37/FLAG8dc49cb97 [2022-02-20 16:21:49,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe65ebfb/ddf87f026a9448d280fe33929695df37 [2022-02-20 16:21:49,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:49,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:49,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:49,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:49,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:49,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24786d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49, skipping insertion in model container [2022-02-20 16:21:49,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:49,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:49,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-02-20 16:21:49,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:49,789 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:49,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-02-20 16:21:49,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:49,828 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:49,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49 WrapperNode [2022-02-20 16:21:49,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:49,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:49,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:49,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:49,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,864 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-02-20 16:21:49,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:49,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:49,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:49,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:49,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:49,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:49,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:49,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:49,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:49,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:49,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:21:49,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:21:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:21:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:49,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:50,016 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:50,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:52,193 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:52,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:52,197 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:52,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:52 BoogieIcfgContainer [2022-02-20 16:21:52,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:52,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:52,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:52,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:52,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:49" (1/3) ... [2022-02-20 16:21:52,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2506e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:52, skipping insertion in model container [2022-02-20 16:21:52,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49" (2/3) ... [2022-02-20 16:21:52,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2506e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:52, skipping insertion in model container [2022-02-20 16:21:52,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:52" (3/3) ... [2022-02-20 16:21:52,203 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-02-20 16:21:52,227 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:52,227 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:21:52,274 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:52,279 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:52,279 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:21:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:52,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:52,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:52,305 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:52,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2022-02-20 16:21:52,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:52,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116779091] [2022-02-20 16:21:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:52,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:52,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:21:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:52,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:21:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:52,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:52,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {22#true} is VALID [2022-02-20 16:21:52,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {22#true} is VALID [2022-02-20 16:21:52,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {22#true} is VALID [2022-02-20 16:21:52,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume !~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {22#true} is VALID [2022-02-20 16:21:52,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#true} main_~main____CPAchecker_TMP_0~0#1 := 0bv32; {39#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| (_ bv0 32))} is VALID [2022-02-20 16:21:52,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| (_ bv0 32))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {23#false} is VALID [2022-02-20 16:21:52,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {23#false} is VALID [2022-02-20 16:21:52,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {23#false} is VALID [2022-02-20 16:21:52,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {23#false} is VALID [2022-02-20 16:21:52,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {23#false} is VALID [2022-02-20 16:21:52,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {23#false} is VALID [2022-02-20 16:21:52,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {23#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {23#false} is VALID [2022-02-20 16:21:52,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 16:21:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:52,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:21:52,495 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:21:52,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116779091] [2022-02-20 16:21:52,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116779091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:52,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:52,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:21:52,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312316811] [2022-02-20 16:21:52,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:52,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:52,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:52,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:21:52,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:21:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:21:52,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:52,532 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:55,028 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:21:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:21:55,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:21:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:21:55,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 16:21:55,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:55,359 INFO L225 Difference]: With dead ends: 40 [2022-02-20 16:21:55,360 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:21:55,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:55,364 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:55,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:21:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:21:55,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:55,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,380 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,381 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:55,382 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-20 16:21:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-20 16:21:55,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:55,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:55,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 15 states. [2022-02-20 16:21:55,383 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 15 states. [2022-02-20 16:21:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:55,384 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-20 16:21:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-20 16:21:55,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:55,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:55,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:55,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-02-20 16:21:55,387 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2022-02-20 16:21:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:55,387 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-20 16:21:55,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-20 16:21:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:55,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:55,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:55,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:55,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:21:55,595 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2022-02-20 16:21:55,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:55,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984491839] [2022-02-20 16:21:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:55,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:55,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:55,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:21:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:55,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:21:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:55,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:55,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {169#true} is VALID [2022-02-20 16:21:55,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {169#true} is VALID [2022-02-20 16:21:55,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {169#true} is VALID [2022-02-20 16:21:55,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {169#true} is VALID [2022-02-20 16:21:55,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {169#true} is VALID [2022-02-20 16:21:55,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {169#true} is VALID [2022-02-20 16:21:55,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {169#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {169#true} is VALID [2022-02-20 16:21:55,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {169#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {169#true} is VALID [2022-02-20 16:21:55,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {169#true} is VALID [2022-02-20 16:21:55,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {201#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| (_ bv1 32))} is VALID [2022-02-20 16:21:55,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| (_ bv1 32))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {205#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} is VALID [2022-02-20 16:21:55,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {170#false} is VALID [2022-02-20 16:21:55,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-02-20 16:21:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:55,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:21:55,740 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:21:55,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984491839] [2022-02-20 16:21:55,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984491839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:55,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:55,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:21:55,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129842992] [2022-02-20 16:21:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:55,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:55,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:55,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:55,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:21:55,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:21:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:21:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:21:55,771 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:04,252 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:22:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:22:04,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 16:22:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 16:22:04,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 16:22:04,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:04,554 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:22:04,555 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:22:04,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:22:04,556 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:04,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:22:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:22:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2022-02-20 16:22:04,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:04,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,559 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,559 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:04,562 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:22:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:22:04,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:04,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:04,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 28 states. [2022-02-20 16:22:04,565 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 28 states. [2022-02-20 16:22:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:04,569 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:22:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:22:04,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:04,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:04,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:04,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 16:22:04,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-02-20 16:22:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:04,571 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 16:22:04,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:22:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:04,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:04,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:04,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:22:04,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:04,781 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2022-02-20 16:22:04,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:04,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062176368] [2022-02-20 16:22:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:04,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:04,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:04,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:04,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:22:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:04,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:22:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:04,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:04,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {335#true} is VALID [2022-02-20 16:22:04,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {335#true} is VALID [2022-02-20 16:22:04,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {335#true} is VALID [2022-02-20 16:22:04,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {335#true} is VALID [2022-02-20 16:22:04,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {335#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {335#true} is VALID [2022-02-20 16:22:04,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {335#true} is VALID [2022-02-20 16:22:04,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {358#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} is VALID [2022-02-20 16:22:04,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {358#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} is VALID [2022-02-20 16:22:04,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {358#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {336#false} is VALID [2022-02-20 16:22:04,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {336#false} is VALID [2022-02-20 16:22:04,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {336#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {336#false} is VALID [2022-02-20 16:22:04,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {336#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {336#false} is VALID [2022-02-20 16:22:04,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 16:22:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:04,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:04,898 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:04,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062176368] [2022-02-20 16:22:04,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062176368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:04,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:04,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:22:04,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236173138] [2022-02-20 16:22:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:04,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:04,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:04,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:04,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:22:04,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:04,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:22:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:04,913 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:08,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:22:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:09,114 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-02-20 16:22:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:22:09,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 16:22:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 16:22:09,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-20 16:22:09,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:09,616 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:22:09,616 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:22:09,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:09,617 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:09,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 16:22:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:22:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-02-20 16:22:09,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:09,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,620 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,620 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:09,621 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 16:22:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 16:22:09,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:09,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:09,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 27 states. [2022-02-20 16:22:09,621 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 27 states. [2022-02-20 16:22:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:09,622 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 16:22:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 16:22:09,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:09,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:09,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:09,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 16:22:09,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-02-20 16:22:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:09,623 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 16:22:09,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 16:22:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:09,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:09,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:09,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:09,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:09,825 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2022-02-20 16:22:09,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:09,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202730285] [2022-02-20 16:22:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:09,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:09,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:09,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:09,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:22:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:10,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:22:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:10,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:10,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {520#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:10,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {520#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {524#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {524#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {531#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {531#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {535#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {535#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {542#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {542#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:10,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {516#false} is VALID [2022-02-20 16:22:10,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {516#false} is VALID [2022-02-20 16:22:10,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {516#false} is VALID [2022-02-20 16:22:10,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {516#false} is VALID [2022-02-20 16:22:10,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-02-20 16:22:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:10,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:10,731 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:10,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202730285] [2022-02-20 16:22:10,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202730285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:10,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:10,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:22:10,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581978718] [2022-02-20 16:22:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:10,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:10,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:10,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:11,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:11,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:22:11,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:11,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:22:11,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:11,009 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:12,762 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-02-20 16:22:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:22:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 16:22:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 16:22:12,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-02-20 16:22:13,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:13,317 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:22:13,318 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:22:13,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:13,321 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:13,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 10 Unchecked, 1.3s Time] [2022-02-20 16:22:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:22:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 16:22:13,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:13,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:13,324 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:13,324 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:13,325 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:22:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:13,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:13,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:13,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 29 states. [2022-02-20 16:22:13,330 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 29 states. [2022-02-20 16:22:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:13,331 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:22:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:13,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:13,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:13,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:13,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-20 16:22:13,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2022-02-20 16:22:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:13,333 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-20 16:22:13,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 16:22:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:22:13,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:13,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:13,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:13,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:13,534 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1249715145, now seen corresponding path program 1 times [2022-02-20 16:22:13,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:13,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998569351] [2022-02-20 16:22:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:13,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:13,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:13,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:13,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:22:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:13,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:22:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:13,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:14,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {725#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:14,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {729#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {729#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {729#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {736#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {736#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {740#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {740#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {740#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {747#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {747#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {747#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:14,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0)); {721#false} is VALID [2022-02-20 16:22:14,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {721#false} is VALID [2022-02-20 16:22:14,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {721#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {721#false} is VALID [2022-02-20 16:22:14,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {721#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {721#false} is VALID [2022-02-20 16:22:14,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {721#false} assume !false; {721#false} is VALID [2022-02-20 16:22:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:14,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:14,412 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:14,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998569351] [2022-02-20 16:22:14,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998569351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:14,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:14,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:22:14,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525951524] [2022-02-20 16:22:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:22:14,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:14,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:14,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:14,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:22:14,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:22:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:14,673 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:16,362 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 16:22:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:22:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:22:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 16:22:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 16:22:16,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 16:22:17,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:17,101 INFO L225 Difference]: With dead ends: 49 [2022-02-20 16:22:17,101 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:22:17,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:17,102 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:17,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 10 Unchecked, 1.3s Time] [2022-02-20 16:22:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:22:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-02-20 16:22:17,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:17,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,106 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,107 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,107 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 16:22:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 16:22:17,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:17,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:17,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 31 states. [2022-02-20 16:22:17,108 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 31 states. [2022-02-20 16:22:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,110 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 16:22:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 16:22:17,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:17,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:17,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:17,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 16:22:17,111 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-02-20 16:22:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:17,112 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 16:22:17,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 16:22:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:22:17,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:17,112 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:17,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:17,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:17,329 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2022-02-20 16:22:17,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:17,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240249] [2022-02-20 16:22:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:17,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:17,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:17,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:22:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:17,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:22:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:37,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {931#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {936#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:37,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {936#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {936#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:37,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {936#(= currentRoundingMode roundNearestTiesToEven)} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {936#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:37,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {936#(= currentRoundingMode roundNearestTiesToEven)} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {946#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {946#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {950#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {950#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {950#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {957#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == main_~__VERIFIER_assert__cond~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {961#(and (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {980#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {980#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {984#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {984#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {984#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:37,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {984#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {991#(and (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))))))} is VALID [2022-02-20 16:22:37,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {991#(and (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))))))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {991#(and (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))))))} is VALID [2022-02-20 16:22:39,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {991#(and (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= |ULTIMATE.start_main_~main__S~0#1| (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))))))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {932#false} is VALID [2022-02-20 16:22:39,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {932#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {932#false} is VALID [2022-02-20 16:22:39,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {932#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {932#false} is VALID [2022-02-20 16:22:39,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {932#false} is VALID [2022-02-20 16:22:39,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {932#false} assume !false; {932#false} is VALID [2022-02-20 16:22:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:39,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:22:47,705 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2022-02-20 16:22:49,755 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2022-02-20 16:23:04,185 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-02-20 16:23:06,238 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true