./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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-2329fc7 [2022-12-14 06:27:08,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:27:08,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:27:08,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:27:08,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:27:08,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:27:08,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:27:08,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:27:08,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:27:08,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:27:08,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:27:08,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:27:08,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:27:08,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:27:08,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:27:08,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:27:08,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:27:08,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:27:08,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:27:08,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:27:08,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:27:08,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:27:08,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:27:08,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:27:08,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:27:08,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:27:08,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:27:08,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:27:08,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:27:08,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:27:08,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:27:08,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:27:08,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:27:08,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:27:08,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:27:08,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:27:08,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:27:08,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:27:08,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:27:08,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:27:08,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:27:08,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 06:27:08,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:27:08,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:27:08,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:27:08,985 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:27:08,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:27:08,986 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:27:08,986 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:27:08,986 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:27:08,986 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:27:08,991 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:27:08,991 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:27:08,991 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:27:08,991 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:27:08,992 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:27:08,992 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:27:08,992 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:27:08,992 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:27:08,992 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:27:08,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:27:08,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:27:08,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:27:08,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:27:08,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:27:08,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:27:08,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:27:08,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:27:08,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:27:08,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:27:08,995 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:27:08,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:27:08,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:27:08,996 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:27:08,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:27:08,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:27:08,996 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:27:08,996 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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-12-14 06:27:09,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:27:09,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:27:09,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:27:09,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:27:09,183 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:27:09,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/float-benchs/filter1.c [2022-12-14 06:27:11,749 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:27:11,894 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:27:11,894 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/sv-benchmarks/c/float-benchs/filter1.c [2022-12-14 06:27:11,900 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data/c67fe9f1f/31278ad8b1174804be09744808a06f68/FLAGc747cc510 [2022-12-14 06:27:11,914 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data/c67fe9f1f/31278ad8b1174804be09744808a06f68 [2022-12-14 06:27:11,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:27:11,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:27:11,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:27:11,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:27:11,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:27:11,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:27:11" (1/1) ... [2022-12-14 06:27:11,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58393b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:11, skipping insertion in model container [2022-12-14 06:27:11,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:27:11" (1/1) ... [2022-12-14 06:27:11,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:27:11,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:27:12,090 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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-12-14 06:27:12,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:27:12,113 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:27:12,125 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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-12-14 06:27:12,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:27:12,140 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:27:12,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12 WrapperNode [2022-12-14 06:27:12,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:27:12,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:27:12,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:27:12,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:27:12,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,172 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-12-14 06:27:12,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:27:12,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:27:12,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:27:12,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:27:12,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,190 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:27:12,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:27:12,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:27:12,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:27:12,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (1/1) ... [2022-12-14 06:27:12,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:27:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:27:12,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:27:12,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:27:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:27:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:27:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:27:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:27:12,309 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:27:12,311 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:27:12,384 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:27:12,414 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:27:12,414 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 06:27:12,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:27:12 BoogieIcfgContainer [2022-12-14 06:27:12,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:27:12,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:27:12,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:27:12,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:27:12,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:27:11" (1/3) ... [2022-12-14 06:27:12,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ae6b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:27:12, skipping insertion in model container [2022-12-14 06:27:12,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:12" (2/3) ... [2022-12-14 06:27:12,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ae6b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:27:12, skipping insertion in model container [2022-12-14 06:27:12,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:27:12" (3/3) ... [2022-12-14 06:27:12,422 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-12-14 06:27:12,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:27:12,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:27:12,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:27:12,477 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;@18fcd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:27:12,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 06:27:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 06:27:12,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:27:12,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 06:27:12,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:27:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:27:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2376458, now seen corresponding path program 1 times [2022-12-14 06:27:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:27:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701938714] [2022-12-14 06:27:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:27:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:27:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:27:12,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 06:27:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:27:12,602 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 06:27:12,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 06:27:12,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 06:27:12,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:27:12,609 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-14 06:27:12,612 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:27:12,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:27:12 BoogieIcfgContainer [2022-12-14 06:27:12,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:27:12,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:27:12,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:27:12,625 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:27:12,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:27:12" (3/4) ... [2022-12-14 06:27:12,628 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 06:27:12,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:27:12,629 INFO L158 Benchmark]: Toolchain (without parser) took 710.19ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 88.0MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:27:12,629 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:27:12,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.29ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 69.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 06:27:12,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 68.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:27:12,630 INFO L158 Benchmark]: Boogie Preprocessor took 18.98ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 67.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:27:12,630 INFO L158 Benchmark]: RCFGBuilder took 223.27ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 55.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 06:27:12,631 INFO L158 Benchmark]: TraceAbstraction took 206.97ms. Allocated memory is still 117.4MB. Free memory was 55.1MB in the beginning and 88.6MB in the end (delta: -33.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-12-14 06:27:12,631 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 117.4MB. Free memory was 88.6MB in the beginning and 88.0MB in the end (delta: 614.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:27:12,633 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.19ms. Allocated memory is still 117.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.29ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 69.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 68.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.98ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 67.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 223.27ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 55.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 206.97ms. Allocated memory is still 117.4MB. Free memory was 55.1MB in the beginning and 88.6MB in the end (delta: -33.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 117.4MB. Free memory was 88.6MB in the beginning and 88.0MB in the end (delta: 614.7kB). 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: 17]: 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 31, overapproximation of to_real at line 34, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 06:27:12,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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-2329fc7 [2022-12-14 06:27:14,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:27:14,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:27:14,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:27:14,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:27:14,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:27:14,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:27:14,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:27:14,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:27:14,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:27:14,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:27:14,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:27:14,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:27:14,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:27:14,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:27:14,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:27:14,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:27:14,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:27:14,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:27:14,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:27:14,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:27:14,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:27:14,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:27:14,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:27:14,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:27:14,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:27:14,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:27:14,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:27:14,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:27:14,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:27:14,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:27:14,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:27:14,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:27:14,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:27:14,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:27:14,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:27:14,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:27:14,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:27:14,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:27:14,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:27:14,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:27:14,213 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 06:27:14,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:27:14,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:27:14,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:27:14,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:27:14,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:27:14,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:27:14,237 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:27:14,237 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:27:14,237 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:27:14,238 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:27:14,238 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:27:14,238 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:27:14,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:27:14,239 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 06:27:14,240 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 06:27:14,240 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 06:27:14,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:27:14,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:27:14,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:27:14,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:27:14,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:27:14,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 06:27:14,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:27:14,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:27:14,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:27:14,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:27:14,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:27:14,242 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 06:27:14,242 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 06:27:14,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:27:14,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:27:14,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 06:27:14,242 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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-12-14 06:27:14,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:27:14,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:27:14,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:27:14,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:27:14,473 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:27:14,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/float-benchs/filter1.c [2022-12-14 06:27:17,010 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:27:17,142 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:27:17,143 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/sv-benchmarks/c/float-benchs/filter1.c [2022-12-14 06:27:17,148 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data/7607a9850/d904a36579e3446c9fb36b2533fb5cc5/FLAGe3d3a5c10 [2022-12-14 06:27:17,159 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/data/7607a9850/d904a36579e3446c9fb36b2533fb5cc5 [2022-12-14 06:27:17,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:27:17,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:27:17,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:27:17,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:27:17,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:27:17,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321fca18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17, skipping insertion in model container [2022-12-14 06:27:17,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:27:17,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:27:17,288 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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-12-14 06:27:17,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:27:17,308 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:27:17,318 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_6f5e4184-65a9-40a8-ab51-67e4c80221ea/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-12-14 06:27:17,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:27:17,331 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:27:17,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17 WrapperNode [2022-12-14 06:27:17,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:27:17,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:27:17,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:27:17,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:27:17,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,356 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-12-14 06:27:17,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:27:17,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:27:17,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:27:17,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:27:17,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,373 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:27:17,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:27:17,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:27:17,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:27:17,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (1/1) ... [2022-12-14 06:27:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:27:17,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:27:17,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:27:17,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:27:17,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:27:17,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 06:27:17,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:27:17,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:27:17,503 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:27:17,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:27:19,648 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:27:19,657 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:27:19,658 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 06:27:19,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:27:19 BoogieIcfgContainer [2022-12-14 06:27:19,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:27:19,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:27:19,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:27:19,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:27:19,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:27:17" (1/3) ... [2022-12-14 06:27:19,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395208be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:27:19, skipping insertion in model container [2022-12-14 06:27:19,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:27:17" (2/3) ... [2022-12-14 06:27:19,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395208be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:27:19, skipping insertion in model container [2022-12-14 06:27:19,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:27:19" (3/3) ... [2022-12-14 06:27:19,673 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-12-14 06:27:19,690 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:27:19,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:27:19,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:27:19,726 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;@5ad24f30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:27:19,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 06:27:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-12-14 06:27:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:27:19,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:27:19,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:27:19,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:27:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:27:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-12-14 06:27:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:27:19,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279076069] [2022-12-14 06:27:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:27:19,747 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-12-14 06:27:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:27:19,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:19,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:27:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 06:27:19,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:27:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:27:19,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:27:19,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:27:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279076069] [2022-12-14 06:27:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279076069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:27:19,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:27:19,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:27:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263562069] [2022-12-14 06:27:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:27:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 06:27:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:27:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 06:27:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 06:27:19,846 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:27:19,856 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-12-14 06:27:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 06:27:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 06:27:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:27:19,862 INFO L225 Difference]: With dead ends: 30 [2022-12-14 06:27:19,862 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 06:27:19,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 06:27:19,867 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:27:19,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:27:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 06:27:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-14 06:27:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-12-14 06:27:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-12-14 06:27:19,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-12-14 06:27:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:27:19,888 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-12-14 06:27:19,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-12-14 06:27:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:27:19,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:27:19,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:27:19,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:20,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:20,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:27:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:27:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-12-14 06:27:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:27:20,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618818914] [2022-12-14 06:27:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:27:20,096 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-12-14 06:27:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:27:20,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:20,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:27:20,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 06:27:20,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:27:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:27:20,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:27:20,282 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:27:20,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618818914] [2022-12-14 06:27:20,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618818914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:27:20,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:27:20,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:27:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546561707] [2022-12-14 06:27:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:27:20,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:27:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:27:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:27:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:27:20,285 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:27:21,853 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-12-14 06:27:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:27:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 06:27:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:27:21,855 INFO L225 Difference]: With dead ends: 28 [2022-12-14 06:27:21,856 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 06:27:21,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:27:21,857 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:27:21,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 06:27:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 06:27:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2022-12-14 06:27:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-12-14 06:27:21,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-12-14 06:27:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:27:21,862 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-12-14 06:27:21,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-12-14 06:27:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:27:21,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:27:21,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:27:21,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 06:27:22,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:22,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:27:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:27:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2022-12-14 06:27:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:27:22,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65113147] [2022-12-14 06:27:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:27:22,069 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-12-14 06:27:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:27:22,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:22,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:27:22,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:27:22,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:27:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:27:23,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:27:23,226 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:27:23,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65113147] [2022-12-14 06:27:23,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65113147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:27:23,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:27:23,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 06:27:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570119674] [2022-12-14 06:27:23,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:27:23,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:27:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:27:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:27:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:27:23,227 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:26,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:27:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:27:27,052 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-12-14 06:27:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:27:27,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 06:27:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:27:27,053 INFO L225 Difference]: With dead ends: 31 [2022-12-14 06:27:27,053 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 06:27:27,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:27:27,054 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 06:27:27,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 06:27:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 06:27:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2022-12-14 06:27:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-12-14 06:27:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-12-14 06:27:27,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-12-14 06:27:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:27:27,057 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-12-14 06:27:27,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:27:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-12-14 06:27:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:27:27,058 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:27:27,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:27:27,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 06:27:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:27,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:27:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:27:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2022-12-14 06:27:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:27:27,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546469934] [2022-12-14 06:27:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:27:27,264 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-12-14 06:27:27,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:27:27,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:27,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/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-12-14 06:27:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:27:27,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 06:27:27,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:27:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:27:46,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:27:59,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-12-14 06:28:01,354 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (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_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-12-14 06:28:23,473 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (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_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-12-14 06:28:25,520 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (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_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-12-14 06:28:52,445 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1))))))) is different from true [2022-12-14 06:30:34,156 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3)))))) is different from true [2022-12-14 06:31:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 06:31:26,470 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:31:26,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546469934] [2022-12-14 06:31:26,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546469934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:31:26,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1948734509] [2022-12-14 06:31:26,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:31:26,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:31:26,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:31:26,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:31:26,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-12-14 06:31:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:31:27,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 06:31:27,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:31:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:31:36,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:32:31,325 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2022-12-14 06:34:12,473 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2022-12-14 06:34:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 06:34:36,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1948734509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:36,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183530730] [2022-12-14 06:34:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:36,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:36,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:36,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:36,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5e4184-65a9-40a8-ab51-67e4c80221ea/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:34:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:38,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 06:34:38,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:47,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:35:42,630 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3))))))) is different from true [2022-12-14 06:37:24,630 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3))))))) is different from true [2022-12-14 06:37:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 06:37:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183530730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:37:51,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 06:37:51,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 23 [2022-12-14 06:37:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541161749] [2022-12-14 06:37:51,109 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 06:37:51,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 06:37:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:37:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 06:37:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=152, Unknown=25, NotChecked=264, Total=506 [2022-12-14 06:37:51,111 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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-12-14 06:37:52,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:37:54,181 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-12-14 06:37:56,880 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-12-14 06:37:58,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:38:13,866 WARN L233 SmtUtils]: Spent 11.54s on a formula simplification. DAG size of input: 48 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:38:22,399 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 46 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:38:25,988 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse4 (fp.neg .cse3)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3)) (.cse6 (fp.mul c_currentRoundingMode .cse9 .cse0)) (.cse8 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse4)) (.cse1 (fp.mul c_currentRoundingMode .cse9 |c_ULTIMATE.start_main_~S~0#1|)) (.cse5 (fp.neg .cse2))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))) .cse7 (or (and .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse8) (and (or (not .cse8) (not .cse7)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse4)))) .cse8 (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))))))) is different from true [2022-12-14 06:38:28,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 06:39:30,589 WARN L233 SmtUtils]: Spent 51.83s on a formula simplification. DAG size of input: 52 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:39:34,096 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-14 06:39:35,681 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 [0, 1] [2022-12-14 06:40:44,682 WARN L233 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 54 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:40:48,305 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-14 06:40:49,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:51,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:57,191 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse3)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse6 (fp.neg .cse7))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (or (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) .cse5) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse6) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse7) (or (let ((.cse8 (fp.mul c_currentRoundingMode .cse4 .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse7)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse6)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2))))) .cse5) (let ((.cse10 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse6)) (.cse9 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse7))) (or (and .cse9 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse10) (and (or (not .cse10) (not .cse9)) .cse5))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-14 06:40:58,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:00,514 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, 1] [2022-12-14 06:41:01,893 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 [0, 1] [2022-12-14 06:41:40,220 WARN L233 SmtUtils]: Spent 27.20s on a formula simplification. DAG size of input: 56 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:41:43,641 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse3 (fp.neg .cse6)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (fp.geq .cse2 .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq .cse2 .cse6) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-12-14 06:41:46,063 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2022-12-14 06:42:06,683 WARN L233 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 29 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:42:08,863 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 [0, 1] [2022-12-14 06:42:12,594 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2022-12-14 06:42:14,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:42:17,059 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse3))))))) is different from true [2022-12-14 06:42:19,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:42:20,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:42:38,485 WARN L233 SmtUtils]: Spent 10.59s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)