./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:48:37,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:48:37,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:48:37,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:48:37,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:48:37,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:48:37,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:48:37,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:48:37,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:48:37,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:48:37,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:48:37,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:48:37,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:48:37,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:48:37,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:48:37,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:48:37,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:48:37,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:48:37,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:48:37,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:48:37,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:48:37,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:48:37,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:48:37,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:48:37,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:48:37,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:48:37,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:48:37,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:48:37,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:48:37,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:48:37,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:48:37,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:48:37,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:48:37,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:48:37,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:48:37,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:48:37,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:48:37,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:48:37,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:48:37,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:48:37,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:48:37,803 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:48:37,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:48:37,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:48:37,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:48:37,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:48:37,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:48:37,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:48:37,843 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:48:37,843 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:48:37,843 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:48:37,844 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:48:37,845 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:48:37,845 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:48:37,846 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:48:37,846 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:48:37,846 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:48:37,846 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:48:37,847 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:48:37,847 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:48:37,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:48:37,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:48:37,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:48:37,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:48:37,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:48:37,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:48:37,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:48:37,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:48:37,850 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:48:37,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:48:37,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:48:37,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:48:37,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:48:37,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:48:37,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:48:37,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:48:37,853 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:48:37,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:48:37,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:48:37,854 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:48:37,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:48:37,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:48:37,856 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:48:37,856 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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-11-23 15:48:38,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:48:38,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:48:38,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:48:38,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:48:38,205 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:48:38,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-23 15:48:41,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:48:41,578 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:48:41,578 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-23 15:48:41,585 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data/d635a70f7/15bbf9b0861449ac9c5de586d234ad1e/FLAG16c31616e [2022-11-23 15:48:41,601 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data/d635a70f7/15bbf9b0861449ac9c5de586d234ad1e [2022-11-23 15:48:41,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:48:41,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:48:41,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:48:41,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:48:41,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:48:41,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a24f1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41, skipping insertion in model container [2022-11-23 15:48:41,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:48:41,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:48:41,804 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-23 15:48:41,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:48:41,826 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:48:41,844 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-23 15:48:41,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:48:41,861 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:48:41,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41 WrapperNode [2022-11-23 15:48:41,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:48:41,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:48:41,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:48:41,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:48:41,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,895 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-11-23 15:48:41,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:48:41,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:48:41,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:48:41,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:48:41,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,915 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:48:41,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:48:41,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:48:41,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:48:41,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (1/1) ... [2022-11-23 15:48:41,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:48:41,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:41,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:48:41,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:48:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:48:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:48:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:48:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:48:42,088 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:48:42,090 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:48:42,216 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:48:42,267 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:48:42,267 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:48:42,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:42 BoogieIcfgContainer [2022-11-23 15:48:42,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:48:42,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:48:42,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:48:42,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:48:42,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:48:41" (1/3) ... [2022-11-23 15:48:42,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24af57c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:42, skipping insertion in model container [2022-11-23 15:48:42,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:41" (2/3) ... [2022-11-23 15:48:42,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24af57c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:42, skipping insertion in model container [2022-11-23 15:48:42,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:42" (3/3) ... [2022-11-23 15:48:42,297 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-11-23 15:48:42,323 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:48:42,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:48:42,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:48:42,397 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c1f4e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:48:42,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:48:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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-11-23 15:48:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:48:42,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:42,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:42,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1090715464, now seen corresponding path program 1 times [2022-11-23 15:48:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:42,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012985245] [2022-11-23 15:48:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:48:42,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012985245] [2022-11-23 15:48:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012985245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:42,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:48:42,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:48:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825293159] [2022-11-23 15:48:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:42,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:48:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:48:42,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:48:42,724 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:48:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:42,808 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2022-11-23 15:48:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:48:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:48:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:42,821 INFO L225 Difference]: With dead ends: 32 [2022-11-23 15:48:42,823 INFO L226 Difference]: Without dead ends: 12 [2022-11-23 15:48:42,827 INFO L412 NwaCegarLoop]: 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-11-23 15:48:42,833 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:42,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:48:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-23 15:48:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-23 15:48:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:48:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-11-23 15:48:42,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2022-11-23 15:48:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:42,878 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-11-23 15:48:42,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:48:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-11-23 15:48:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:48:42,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:42,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:42,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:48:42,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:42,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash -201086419, now seen corresponding path program 1 times [2022-11-23 15:48:42,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:42,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527265224] [2022-11-23 15:48:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:48:43,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527265224] [2022-11-23 15:48:43,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527265224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:43,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:48:43,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:48:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907977158] [2022-11-23 15:48:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:43,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:48:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:48:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:48:43,104 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:48:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:43,194 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-23 15:48:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:48:43,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:48:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:43,196 INFO L225 Difference]: With dead ends: 29 [2022-11-23 15:48:43,196 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 15:48:43,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:48:43,199 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:43,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:48:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 15:48:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2022-11-23 15:48:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-11-23 15:48:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-23 15:48:43,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-11-23 15:48:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:43,214 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-23 15:48:43,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:48:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-23 15:48:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:48:43,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:43,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:43,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:48:43,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -184075758, now seen corresponding path program 1 times [2022-11-23 15:48:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:43,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119723225] [2022-11-23 15:48:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:48:43,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:48:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:48:43,316 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:48:43,316 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:48:43,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 15:48:43,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:48:43,324 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-23 15:48:43,327 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:48:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:48:43 BoogieIcfgContainer [2022-11-23 15:48:43,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:48:43,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:48:43,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:48:43,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:48:43,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:42" (3/4) ... [2022-11-23 15:48:43,357 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:48:43,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:48:43,358 INFO L158 Benchmark]: Toolchain (without parser) took 1753.00ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 57.9MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-23 15:48:43,359 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 127.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:48:43,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.04ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 107.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 15:48:43,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.09ms. Allocated memory is still 161.5MB. Free memory was 107.6MB in the beginning and 106.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:48:43,361 INFO L158 Benchmark]: Boogie Preprocessor took 21.24ms. Allocated memory is still 161.5MB. Free memory was 106.1MB in the beginning and 105.3MB in the end (delta: 867.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:48:43,362 INFO L158 Benchmark]: RCFGBuilder took 351.91ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 15:48:43,362 INFO L158 Benchmark]: TraceAbstraction took 1078.32ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 58.5MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-23 15:48:43,363 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 161.5MB. Free memory was 58.5MB in the beginning and 57.9MB in the end (delta: 628.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:48:43,367 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 127.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.04ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 107.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.09ms. Allocated memory is still 161.5MB. Free memory was 107.6MB in the beginning and 106.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.24ms. Allocated memory is still 161.5MB. Free memory was 106.1MB in the beginning and 105.3MB in the end (delta: 867.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 351.91ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1078.32ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 58.5MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 161.5MB. Free memory was 58.5MB in the beginning and 57.9MB in the end (delta: 628.4kB). 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, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80. Possible FailurePath: [L1] int __return_main; [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=53, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__E0=53, 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=53, 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 [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=53, main__E1=53, 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=53, main__E1=53, 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=53, main__E1=53, 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=53, main__E1=53, 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=53, main__E1=53, 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=53, main__E1=53, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 34 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 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-11-23 15:48:43,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:48:45,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:48:45,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:48:45,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:48:45,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:48:45,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:48:45,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:48:45,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:48:45,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:48:46,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:48:46,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:48:46,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:48:46,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:48:46,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:48:46,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:48:46,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:48:46,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:48:46,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:48:46,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:48:46,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:48:46,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:48:46,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:48:46,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:48:46,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:48:46,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:48:46,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:48:46,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:48:46,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:48:46,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:48:46,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:48:46,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:48:46,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:48:46,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:48:46,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:48:46,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:48:46,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:48:46,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:48:46,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:48:46,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:48:46,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:48:46,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:48:46,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-23 15:48:46,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:48:46,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:48:46,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:48:46,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:48:46,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:48:46,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:48:46,108 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:48:46,108 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:48:46,108 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:48:46,108 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:48:46,109 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:48:46,109 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:48:46,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:48:46,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:48:46,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:48:46,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:48:46,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:48:46,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:48:46,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:48:46,112 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:48:46,112 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 15:48:46,112 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 15:48:46,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:48:46,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:48:46,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:48:46,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:48:46,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:48:46,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 15:48:46,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:48:46,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:48:46,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:48:46,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:48:46,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:48:46,115 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 15:48:46,115 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 15:48:46,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:48:46,116 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:48:46,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 15:48:46,116 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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-11-23 15:48:46,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:48:46,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:48:46,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:48:46,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:48:46,494 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:48:46,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-23 15:48:49,558 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:48:49,790 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:48:49,791 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2022-11-23 15:48:49,797 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data/71efe4ff5/33911b22e7b84fb4990b07a8e76c3375/FLAG7ade769ed [2022-11-23 15:48:49,816 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/data/71efe4ff5/33911b22e7b84fb4990b07a8e76c3375 [2022-11-23 15:48:49,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:48:49,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:48:49,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:48:49,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:48:49,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:48:49,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:49" (1/1) ... [2022-11-23 15:48:49,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173694f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:49, skipping insertion in model container [2022-11-23 15:48:49,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:49" (1/1) ... [2022-11-23 15:48:49,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:48:49,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:48:50,058 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-23 15:48:50,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:48:50,089 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:48:50,120 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2022-11-23 15:48:50,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:48:50,164 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:48:50,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50 WrapperNode [2022-11-23 15:48:50,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:48:50,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:48:50,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:48:50,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:48:50,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,211 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-11-23 15:48:50,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:48:50,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:48:50,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:48:50,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:48:50,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:48:50,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:48:50,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:48:50,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:48:50,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (1/1) ... [2022-11-23 15:48:50,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:48:50,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:50,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:48:50,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:48:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:48:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 15:48:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:48:50,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:48:50,451 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:48:50,454 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:48:52,733 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:48:52,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:48:52,740 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:48:52,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:52 BoogieIcfgContainer [2022-11-23 15:48:52,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:48:52,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:48:52,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:48:52,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:48:52,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:48:49" (1/3) ... [2022-11-23 15:48:52,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a16ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:52, skipping insertion in model container [2022-11-23 15:48:52,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:50" (2/3) ... [2022-11-23 15:48:52,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a16ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:52, skipping insertion in model container [2022-11-23 15:48:52,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:52" (3/3) ... [2022-11-23 15:48:52,753 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2022-11-23 15:48:52,774 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:48:52,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:48:52,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:48:52,834 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a5c4457, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:48:52,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:48:52,839 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-11-23 15:48:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:48:52,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:52,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:52,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2022-11-23 15:48:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:48:52,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217136456] [2022-11-23 15:48:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:52,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:48:52,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:48:52,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 15:48:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:53,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 15:48:53,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:48:53,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:53,126 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:48:53,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217136456] [2022-11-23 15:48:53,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217136456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:53,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:48:53,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:48:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24534162] [2022-11-23 15:48:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:53,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:48:53,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:48:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:48:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:48:53,180 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-11-23 15:48:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:53,426 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-11-23 15:48:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:48:53,429 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-11-23 15:48:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:53,438 INFO L225 Difference]: With dead ends: 40 [2022-11-23 15:48:53,439 INFO L226 Difference]: Without dead ends: 15 [2022-11-23 15:48:53,442 INFO L412 NwaCegarLoop]: 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-11-23 15:48:53,446 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:53,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:48:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-23 15:48:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-23 15:48:53,484 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-11-23 15:48:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-11-23 15:48:53,486 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2022-11-23 15:48:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:53,487 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-11-23 15:48:53,487 INFO L496 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-11-23 15:48:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-11-23 15:48:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:48:53,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:53,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:53,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:53,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:53,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2022-11-23 15:48:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:48:53,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389900520] [2022-11-23 15:48:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:53,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:48:53,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:48:53,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 15:48:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:53,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 15:48:53,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:48:53,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:53,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:48:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389900520] [2022-11-23 15:48:53,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389900520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:53,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:48:53,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:48:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778063345] [2022-11-23 15:48:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:53,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:48:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:48:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:48:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:48:53,898 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-11-23 15:48:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:54,020 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-11-23 15:48:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:48:54,022 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-11-23 15:48:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:54,022 INFO L225 Difference]: With dead ends: 30 [2022-11-23 15:48:54,023 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 15:48:54,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:48:54,024 INFO L413 NwaCegarLoop]: 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-11-23 15:48:54,025 INFO L414 NwaCegarLoop]: 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-11-23 15:48:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 15:48:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2022-11-23 15:48:54,030 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-11-23 15:48:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-11-23 15:48:54,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-11-23 15:48:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:54,038 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-23 15:48:54,039 INFO L496 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-11-23 15:48:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-11-23 15:48:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:48:54,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:54,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:54,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:54,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:54,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2022-11-23 15:48:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:48:54,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649999136] [2022-11-23 15:48:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:54,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:54,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:48:54,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:48:54,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 15:48:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:54,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 15:48:54,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:48:54,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:54,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:48:54,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649999136] [2022-11-23 15:48:54,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649999136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:54,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:48:54,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:48:54,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14653377] [2022-11-23 15:48:54,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:54,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:48:54,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:48:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:48:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:48:54,418 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-11-23 15:48:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:55,178 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-11-23 15:48:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:48:55,181 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-11-23 15:48:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:55,182 INFO L225 Difference]: With dead ends: 42 [2022-11-23 15:48:55,182 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 15:48:55,183 INFO L412 NwaCegarLoop]: 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-11-23 15:48:55,184 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:55,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 15:48:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 15:48:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-11-23 15:48:55,195 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-11-23 15:48:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-23 15:48:55,198 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-11-23 15:48:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:55,199 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-23 15:48:55,199 INFO L496 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-11-23 15:48:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-23 15:48:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:48:55,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:55,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:48:55,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:55,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:55,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2022-11-23 15:48:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:48:55,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346514117] [2022-11-23 15:48:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:55,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:48:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:48:55,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:48:55,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 15:48:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:55,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 15:48:55,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:48:56,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:56,858 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:48:56,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346514117] [2022-11-23 15:48:56,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346514117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:56,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:48:56,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:48:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437098898] [2022-11-23 15:48:56,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:56,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:48:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:48:56,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:48:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:48:56,861 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-11-23 15:49:00,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:49:02,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:49:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:02,877 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-11-23 15:49:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:49:02,921 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-11-23 15:49:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:02,922 INFO L225 Difference]: With dead ends: 54 [2022-11-23 15:49:02,922 INFO L226 Difference]: Without dead ends: 36 [2022-11-23 15:49:02,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:49:02,924 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:02,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-11-23 15:49:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-23 15:49:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2022-11-23 15:49:02,932 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-11-23 15:49:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-23 15:49:02,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2022-11-23 15:49:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:02,933 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-23 15:49:02,933 INFO L496 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-11-23 15:49:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-23 15:49:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:49:02,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:02,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:02,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-23 15:49:03,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:49:03,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:49:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2022-11-23 15:49:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:49:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060697953] [2022-11-23 15:49:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:49:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:49:03,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:49:03,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 15:49:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:03,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:49:03,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:27,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:35,425 WARN L837 $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-11-23 15:49:37,475 WARN L859 $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-11-23 15:49:51,939 WARN L837 $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-11-23 15:49:53,991 WARN L859 $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 [2022-11-23 15:50:08,581 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (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|) |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 |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2022-11-23 15:51:25,167 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (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|) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) is different from true [2022-11-23 15:51:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-23 15:51:39,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:51:39,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060697953] [2022-11-23 15:51:39,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060697953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:51:39,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1168165946] [2022-11-23 15:51:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:39,753 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:51:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:51:39,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:51:39,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-23 15:51:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:40,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:51:40,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:51:55,873 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from false [2022-11-23 15:51:57,882 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse0)))) is different from true [2022-11-23 15:52:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 15:52:24,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:54:10,891 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse0))) (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|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2022-11-23 15:54:31,945 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (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)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from true [2022-11-23 15:54:38,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))))) is different from false [2022-11-23 15:54:40,633 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))))))) is different from true [2022-11-23 15:54:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-23 15:54:49,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1168165946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:54:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803400229] [2022-11-23 15:54:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:54:49,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:54:49,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:54:49,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:54:49,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 15:54:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:54:54,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 15:54:54,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:54:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:54:59,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:56:32,410 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (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|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2022-11-23 15:56:46,996 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_17| (fp.neg .cse0))) (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|) |v_ULTIMATE.start_main_~main__E0~0#1_17|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse0))))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2022-11-23 15:56:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-23 15:56:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803400229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:56:54,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 15:56:54,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 9, 9, 9] total 22 [2022-11-23 15:56:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704904999] [2022-11-23 15:56:54,927 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 15:56:54,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 15:56:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:56:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 15:56:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=85, Unknown=20, NotChecked=290, Total=462 [2022-11-23 15:56:54,930 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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-11-23 15:56:56,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:57:26,079 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:57:27,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:57:28,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:57:30,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:57:31,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:57:33,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 15:57:35,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:58:10,719 WARN L233 SmtUtils]: Spent 20.73s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:58:12,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:58:14,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:58:15,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:58:17,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 15:58:19,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:58:21,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:58:40,062 WARN L233 SmtUtils]: Spent 10.32s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:58:43,460 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_17|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse1)))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse3))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-23 15:58:46,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 15:58:57,261 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.neg .cse1)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse4)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)))))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (or .cse2 (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse3))) (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| .cse4) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse4) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse0) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))) .cse2 (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse4) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-23 15:58:59,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:59:01,977 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (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|) |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 |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-23 15:59:25,489 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (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| .cse1))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-23 15:59:35,501 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:59:38,207 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (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))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-23 15:59:40,532 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_17|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse3)))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0))))))) is different from false [2022-11-23 15:59:42,635 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_17|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse3)))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0))))))) is different from true [2022-11-23 15:59:45,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:59:48,719 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse3))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_17|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse3)))) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2))) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-23 15:59:50,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:59:52,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 15:59:55,082 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (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|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) (and (or .cse0 (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))) .cse0))) is different from true [2022-11-23 15:59:58,476 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse1 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse3)) (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|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (or .cse1 (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2))) .cse1 (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-23 16:00:00,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:02,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 16:00:04,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:08,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:10,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:13,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:15,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:17,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:19,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:29,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:40,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2))) is different from false [2022-11-23 16:00:42,724 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (and (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| (fp.neg .cse0)))))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2))) is different from true [2022-11-23 16:00:44,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:46,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 16:00:48,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 16:00:51,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 16:01:07,080 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse4 (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)) (.cse1 (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~main__S~0#1|)) (.cse0 (fp.neg .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_17|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_17| .cse3)))) (not .cse4)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0)))) .cse4 (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_11| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~main__E0~0#1_11|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_11| .cse0))))))) is different from true [2022-11-23 16:01:09,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:01:11,415 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))) (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse3)) (.cse0 (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse2))) (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|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))))) (and (or .cse0 (not .cse1)) .cse1 .cse0))) is different from true [2022-11-23 16:01:13,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:01:15,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:01:17,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:01:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:01:17,947 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-11-23 16:01:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-23 16:01:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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 23 [2022-11-23 16:01:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:01:18,017 INFO L225 Difference]: With dead ends: 117 [2022-11-23 16:01:18,017 INFO L226 Difference]: Without dead ends: 99 [2022-11-23 16:01:18,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 248.7s TimeCoverageRelationStatistics Valid=197, Invalid=329, Unknown=68, NotChecked=1386, Total=1980 [2022-11-23 16:01:18,020 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 93 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 78.5s IncrementalHoareTripleChecker+Time [2022-11-23 16:01:18,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 83 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 24 Unknown, 562 Unchecked, 78.5s Time] [2022-11-23 16:01:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-23 16:01:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 60. [2022-11-23 16:01:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 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-11-23 16:01:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-11-23 16:01:18,037 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 23 [2022-11-23 16:01:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:01:18,047 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-11-23 16:01:18,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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-11-23 16:01:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-11-23 16:01:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 16:01:18,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:01:18,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:01:18,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 16:01:18,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:01:18,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:01:18,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 16:01:18,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:01:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:01:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2022-11-23 16:01:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:01:18,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856762088] [2022-11-23 16:01:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:01:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:01:18,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:01:18,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:01:18,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b91367f-abd2-4ff1-aba1-ad62206ea90d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 16:01:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:01:21,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 16:01:21,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:01:49,302 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-23 16:01:51,340 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-23 16:02:37,858 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-11-23 16:02:39,898 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-11-23 16:03:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-23 16:03:49,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:03:55,787 WARN L837 $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-11-23 16:03:57,862 WARN L859 $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