./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:14:39,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:14:39,777 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 13:14:39,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:14:39,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:14:39,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:14:39,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:14:39,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:14:39,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:14:39,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:14:39,809 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:14:39,809 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:14:39,810 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:14:39,810 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:14:39,811 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:14:39,811 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:14:39,812 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:14:39,812 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:14:39,813 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:14:39,813 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:14:39,814 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:14:39,814 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:14:39,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:14:39,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:14:39,816 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:14:39,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:14:39,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:14:39,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:14:39,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:14:39,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:14:39,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:14:39,819 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:14:39,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:14:39,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:14:39,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:14:39,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:14:39,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:14:39,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:14:39,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:14:39,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:14:39,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:14:39,822 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:14:39,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:14:39,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:14:39,822 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:14:39,822 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:14:39,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:14:39,823 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2023-12-02 13:14:40,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:14:40,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:14:40,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:14:40,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:14:40,075 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:14:40,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2023-12-02 13:14:43,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:14:43,210 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:14:43,211 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2023-12-02 13:14:43,219 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data/816897820/83774ddecc2e4e589b8fb3d39cf2e920/FLAGdbadeb1b0 [2023-12-02 13:14:43,231 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data/816897820/83774ddecc2e4e589b8fb3d39cf2e920 [2023-12-02 13:14:43,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:14:43,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:14:43,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:14:43,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:14:43,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:14:43,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8aac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43, skipping insertion in model container [2023-12-02 13:14:43,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,270 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:14:43,432 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2023-12-02 13:14:43,441 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2023-12-02 13:14:43,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:14:43,460 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:14:43,477 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2023-12-02 13:14:43,481 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2023-12-02 13:14:43,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:14:43,501 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:14:43,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43 WrapperNode [2023-12-02 13:14:43,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:14:43,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:14:43,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:14:43,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:14:43,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,541 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2023-12-02 13:14:43,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:14:43,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:14:43,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:14:43,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:14:43,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:14:43,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:14:43,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:14:43,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:14:43,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (1/1) ... [2023-12-02 13:14:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:14:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:14:43,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:14:43,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:14:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:14:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:14:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:14:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:14:43,726 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:14:43,728 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:14:43,900 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:14:43,940 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:14:43,940 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 13:14:43,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:43 BoogieIcfgContainer [2023-12-02 13:14:43,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:14:43,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:14:43,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:14:43,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:14:43,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:14:43" (1/3) ... [2023-12-02 13:14:43,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3516df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:14:43, skipping insertion in model container [2023-12-02 13:14:43,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:43" (2/3) ... [2023-12-02 13:14:43,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3516df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:14:43, skipping insertion in model container [2023-12-02 13:14:43,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:43" (3/3) ... [2023-12-02 13:14:43,954 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2023-12-02 13:14:43,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:14:43,978 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 13:14:44,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:14:44,049 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=LoopHeads, 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;@7849b594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:14:44,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 13:14:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 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) [2023-12-02 13:14:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:14:44,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:44,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:14:44,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:44,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -912134591, now seen corresponding path program 1 times [2023-12-02 13:14:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:14:44,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452534721] [2023-12-02 13:14:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:44,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:14:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:14:44,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:14:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452534721] [2023-12-02 13:14:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452534721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:14:44,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:14:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:14:44,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861945625] [2023-12-02 13:14:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:14:44,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:14:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:14:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:14:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:14:44,376 INFO L87 Difference]: Start difference. First operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 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 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:14:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:14:44,472 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2023-12-02 13:14:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:14:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 13:14:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:14:44,483 INFO L225 Difference]: With dead ends: 38 [2023-12-02 13:14:44,483 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 13:14:44,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:14:44,490 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:14:44,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 95 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:14:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 13:14:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-02 13:14:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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) [2023-12-02 13:14:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-02 13:14:44,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2023-12-02 13:14:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:14:44,528 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-02 13:14:44,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:14:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-02 13:14:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:14:44,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:44,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:14:44,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:14:44,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:44,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash -842691770, now seen corresponding path program 1 times [2023-12-02 13:14:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:14:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95113658] [2023-12-02 13:14:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:14:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:14:44,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 13:14:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:14:44,586 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 13:14:44,586 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 13:14:44,588 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-02 13:14:44,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 13:14:44,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:14:44,595 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 13:14:44,598 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:14:44,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:14:44 BoogieIcfgContainer [2023-12-02 13:14:44,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:14:44,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:14:44,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:14:44,624 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:14:44,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:43" (3/4) ... [2023-12-02 13:14:44,627 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 13:14:44,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:14:44,629 INFO L158 Benchmark]: Toolchain (without parser) took 1395.08ms. Allocated memory is still 161.5MB. Free memory was 122.0MB in the beginning and 61.6MB in the end (delta: 60.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2023-12-02 13:14:44,629 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:14:44,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.23ms. Allocated memory is still 161.5MB. Free memory was 122.0MB in the beginning and 109.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 13:14:44,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.08ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 108.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:14:44,631 INFO L158 Benchmark]: Boogie Preprocessor took 28.64ms. Allocated memory is still 161.5MB. Free memory was 108.3MB in the beginning and 106.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:14:44,632 INFO L158 Benchmark]: RCFGBuilder took 370.66ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 93.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 13:14:44,632 INFO L158 Benchmark]: TraceAbstraction took 676.93ms. Allocated memory is still 161.5MB. Free memory was 92.6MB in the beginning and 61.6MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-12-02 13:14:44,633 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 161.5MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:14:44,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.23ms. Allocated memory is still 161.5MB. Free memory was 122.0MB in the beginning and 109.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.08ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 108.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.64ms. Allocated memory is still 161.5MB. Free memory was 108.3MB in the beginning and 106.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.66ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 93.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 676.93ms. Allocated memory is still 161.5MB. Free memory was 92.6MB in the beginning and 61.6MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 161.5MB. Free memory is still 61.6MB. 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: 59]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of to_real at line 42, overapproximation of someBinaryArithmeticDOUBLEoperation at line 177. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __tmp_112_0; [L17] int __return_134; [L20] double main__E0; [L21] double main__E1; [L22] double main__S; [L23] int main__i; [L24] main__E1 = 0 [L25] main__S = 0 [L26] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L27] COND TRUE main__i <= 1000000 [L29] main__E0 = __VERIFIER_nondet_double() [L30] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L31] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L33] COND TRUE main__E0 <= 1.0 [L35] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L36] COND TRUE main____CPAchecker_TMP_0 != 0 [L38] int main____CPAchecker_TMP_1; [L39] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L40] COND FALSE !(!(main____CPAchecker_TMP_1 == 0)) [L177] main__S = ((0.999 * main__S) + main__E0) - main__E1 [L44] main__E1 = main__E0 [L45] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0] [L46] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0] [L166] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__i=0] [L53] int __tmp_1; [L54] __tmp_1 = main____CPAchecker_TMP_2 [L55] int __VERIFIER_assert__cond; [L56] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __tmp_1=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__i=0] [L57] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __tmp_1=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__i=0] [L59] reach_error() VAL [__VERIFIER_assert__cond=0, __return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __tmp_1=0, main__E0=53, main__E1=53, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 105]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 32 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2023-12-02 13:14:44,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:14:46,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:14:46,792 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 13:14:46,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:14:46,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:14:46,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:14:46,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:14:46,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:14:46,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:14:46,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:14:46,830 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:14:46,830 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:14:46,831 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:14:46,831 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:14:46,832 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:14:46,832 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:14:46,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:14:46,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:14:46,834 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:14:46,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:14:46,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:14:46,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:14:46,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:14:46,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:14:46,838 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:14:46,838 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 13:14:46,838 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 13:14:46,839 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:14:46,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:14:46,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:14:46,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:14:46,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 13:14:46,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:14:46,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:14:46,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:14:46,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:14:46,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:14:46,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:14:46,842 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 13:14:46,842 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 13:14:46,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:14:46,843 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:14:46,843 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:14:46,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:14:46,843 INFO L153 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_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2023-12-02 13:14:47,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:14:47,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:14:47,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:14:47,149 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:14:47,149 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:14:47,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2023-12-02 13:14:50,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:14:50,476 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:14:50,477 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2023-12-02 13:14:50,483 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data/3deaaff00/e4b562d76c67416abcf2bbb78649e4a8/FLAG1436af35f [2023-12-02 13:14:50,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/data/3deaaff00/e4b562d76c67416abcf2bbb78649e4a8 [2023-12-02 13:14:50,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:14:50,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:14:50,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:14:50,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:14:50,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:14:50,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc2fe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50, skipping insertion in model container [2023-12-02 13:14:50,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,538 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:14:50,700 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2023-12-02 13:14:50,711 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2023-12-02 13:14:50,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:14:50,736 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:14:50,753 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2023-12-02 13:14:50,759 WARN L240 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_d1122dcd-0366-4624-97ab-0c662fc02b07/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2023-12-02 13:14:50,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:14:50,784 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:14:50,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50 WrapperNode [2023-12-02 13:14:50,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:14:50,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:14:50,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:14:50,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:14:50,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,830 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2023-12-02 13:14:50,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:14:50,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:14:50,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:14:50,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:14:50,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:14:50,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:14:50,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:14:50,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:14:50,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (1/1) ... [2023-12-02 13:14:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:14:50,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:14:50,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:14:50,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:14:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:14:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 13:14:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:14:50,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:14:51,021 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:14:51,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:14:55,388 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:14:55,421 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:14:55,421 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 13:14:55,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:55 BoogieIcfgContainer [2023-12-02 13:14:55,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:14:55,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:14:55,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:14:55,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:14:55,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:14:50" (1/3) ... [2023-12-02 13:14:55,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb6cc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:14:55, skipping insertion in model container [2023-12-02 13:14:55,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:50" (2/3) ... [2023-12-02 13:14:55,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb6cc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:14:55, skipping insertion in model container [2023-12-02 13:14:55,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:55" (3/3) ... [2023-12-02 13:14:55,449 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2023-12-02 13:14:55,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:14:55,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 13:14:55,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:14:55,536 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=LoopHeads, 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;@79ac79f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:14:55,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 13:14:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 31 states have internal predecessors, (47), 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) [2023-12-02 13:14:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:14:55,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:55,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:14:55,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:55,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1914863237, now seen corresponding path program 1 times [2023-12-02 13:14:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:14:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247235249] [2023-12-02 13:14:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:55,569 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 [2023-12-02 13:14:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:14:55,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:14:55,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:14:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:55,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:14:55,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:14:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:14:55,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:14:55,735 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:14:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247235249] [2023-12-02 13:14:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247235249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:14:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:14:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:14:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622372647] [2023-12-02 13:14:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:14:55,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:14:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:14:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:14:55,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:14:55,773 INFO L87 Difference]: Start difference. First operand has 32 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-12-02 13:14:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:14:55,926 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2023-12-02 13:14:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:14:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-12-02 13:14:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:14:55,939 INFO L225 Difference]: With dead ends: 56 [2023-12-02 13:14:55,940 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 13:14:55,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:14:55,947 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:14:55,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:14:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 13:14:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-12-02 13:14:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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) [2023-12-02 13:14:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-12-02 13:14:55,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2023-12-02 13:14:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:14:55,988 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-12-02 13:14:55,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-12-02 13:14:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-12-02 13:14:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:14:55,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:55,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:14:55,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:14:56,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:14:56,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:56,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1984306058, now seen corresponding path program 1 times [2023-12-02 13:14:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:14:56,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729329608] [2023-12-02 13:14:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:56,196 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 [2023-12-02 13:14:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:14:56,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:14:56,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:14:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:56,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:14:56,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:14:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:14:56,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:14:56,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:14:56,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729329608] [2023-12-02 13:14:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729329608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:14:56,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:14:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:14:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096464738] [2023-12-02 13:14:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:14:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:14:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:14:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:14:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:14:56,312 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-12-02 13:14:57,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:14:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:14:58,143 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2023-12-02 13:14:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:14:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-12-02 13:14:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:14:58,145 INFO L225 Difference]: With dead ends: 70 [2023-12-02 13:14:58,145 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 13:14:58,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:14:58,147 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:14:58,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 13:14:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 13:14:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2023-12-02 13:14:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 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) [2023-12-02 13:14:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-02 13:14:58,153 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 12 [2023-12-02 13:14:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:14:58,153 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-02 13:14:58,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-12-02 13:14:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-02 13:14:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:14:58,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:58,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:14:58,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-02 13:14:58,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:14:58,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:58,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:58,356 INFO L85 PathProgramCache]: Analyzing trace with hash -29843494, now seen corresponding path program 1 times [2023-12-02 13:14:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:14:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972131173] [2023-12-02 13:14:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:58,357 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 [2023-12-02 13:14:58,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:14:58,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:14:58,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:14:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:58,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:14:58,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:14:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:14:59,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:14:59,576 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:14:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972131173] [2023-12-02 13:14:59,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972131173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:14:59,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:14:59,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:14:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843877210] [2023-12-02 13:14:59,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:14:59,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:14:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:14:59,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:14:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:14:59,580 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-12-02 13:15:03,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:15:05,394 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] [2023-12-02 13:15:07,396 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] [2023-12-02 13:15:09,400 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] [2023-12-02 13:15:11,404 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] [2023-12-02 13:15:13,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:15:15,686 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 [] [2023-12-02 13:15:17,690 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 [] [2023-12-02 13:15:19,695 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] [2023-12-02 13:15:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:15:19,695 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2023-12-02 13:15:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:15:19,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-12-02 13:15:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:15:19,745 INFO L225 Difference]: With dead ends: 69 [2023-12-02 13:15:19,745 INFO L226 Difference]: Without dead ends: 46 [2023-12-02 13:15:19,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:15:19,747 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:15:19,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 20.1s Time] [2023-12-02 13:15:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-02 13:15:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2023-12-02 13:15:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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) [2023-12-02 13:15:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-02 13:15:19,753 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 12 [2023-12-02 13:15:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:15:19,753 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-02 13:15:19,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-12-02 13:15:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-02 13:15:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:15:19,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:15:19,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:15:19,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:15:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:15:19,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:15:19,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:15:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2103816760, now seen corresponding path program 1 times [2023-12-02 13:15:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:15:19,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947160899] [2023-12-02 13:15:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:15:19,957 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 [2023-12-02 13:15:19,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:15:19,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:15:19,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:15:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:15:20,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:15:20,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:15:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:15:20,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:15:20,038 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:15:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947160899] [2023-12-02 13:15:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947160899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:15:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:15:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:15:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60634674] [2023-12-02 13:15:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:15:20,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:15:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:15:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:15:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:15:20,041 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:15:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:15:20,066 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-12-02 13:15:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:15:20,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:15:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:15:20,068 INFO L225 Difference]: With dead ends: 48 [2023-12-02 13:15:20,068 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 13:15:20,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:15:20,069 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:15:20,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:15:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 13:15:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-02 13:15:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2023-12-02 13:15:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-02 13:15:20,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2023-12-02 13:15:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:15:20,073 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-02 13:15:20,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:15:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-02 13:15:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:15:20,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:15:20,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:15:20,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 13:15:20,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:15:20,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:15:20,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:15:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1728058157, now seen corresponding path program 1 times [2023-12-02 13:15:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:15:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310523804] [2023-12-02 13:15:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:15:20,277 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 [2023-12-02 13:15:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:15:20,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:15:20,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 13:15:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:15:20,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:15:20,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:15:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:15:20,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:15:20,364 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:15:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310523804] [2023-12-02 13:15:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310523804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:15:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:15:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:15:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88137304] [2023-12-02 13:15:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:15:20,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:15:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:15:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:15:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:15:20,367 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:15:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:15:20,463 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2023-12-02 13:15:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:15:20,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:15:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:15:20,464 INFO L225 Difference]: With dead ends: 47 [2023-12-02 13:15:20,465 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 13:15:20,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:15:20,466 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:15:20,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:15:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 13:15:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2023-12-02 13:15:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2023-12-02 13:15:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-12-02 13:15:20,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2023-12-02 13:15:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:15:20,472 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-12-02 13:15:20,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:15:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-12-02 13:15:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:15:20,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:15:20,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:15:20,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 13:15:20,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:15:20,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:15:20,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:15:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1837142933, now seen corresponding path program 1 times [2023-12-02 13:15:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:15:20,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017585739] [2023-12-02 13:15:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:15:20,682 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 [2023-12-02 13:15:20,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:15:20,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:15:20,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 13:15:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:15:21,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:15:21,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:15:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:15:36,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:15:36,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:15:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017585739] [2023-12-02 13:15:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017585739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:15:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:15:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:15:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75958726] [2023-12-02 13:15:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:15:36,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:15:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:15:36,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:15:36,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=49, Unknown=3, NotChecked=0, Total=90 [2023-12-02 13:15:36,331 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:15:52,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:15:54,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:15:56,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:15:58,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:01,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:03,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:05,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:07,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:09,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:11,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:13,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:15,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:17,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:19,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:21,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:23,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:16:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:23,857 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-12-02 13:16:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:16:23,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:16:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:23,900 INFO L225 Difference]: With dead ends: 74 [2023-12-02 13:16:23,900 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 13:16:23,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=53, Invalid=74, Unknown=5, NotChecked=0, Total=132 [2023-12-02 13:16:23,901 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:23,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 36.8s Time] [2023-12-02 13:16:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 13:16:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2023-12-02 13:16:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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) [2023-12-02 13:16:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2023-12-02 13:16:23,907 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 23 [2023-12-02 13:16:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:23,907 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2023-12-02 13:16:23,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:16:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2023-12-02 13:16:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:16:23,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:23,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:23,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 13:16:24,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:16:24,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:16:24,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1447451, now seen corresponding path program 1 times [2023-12-02 13:16:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:16:24,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952437585] [2023-12-02 13:16:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:24,112 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 [2023-12-02 13:16:24,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:16:24,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:16:24,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 (8)] Waiting until timeout for monitored process [2023-12-02 13:16:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:25,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 13:16:25,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:16:52,140 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 13:17:37,909 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2023-12-02 13:17:39,934 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2023-12-02 13:18:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:18:47,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:18:47,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:18:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952437585] [2023-12-02 13:18:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952437585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:18:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:18:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:18:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355487104] [2023-12-02 13:18:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:18:47,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:18:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:18:47,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:18:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=46, Unknown=3, NotChecked=30, Total=110 [2023-12-02 13:18:47,673 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:18:51,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:18:53,633 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 [] [2023-12-02 13:18:55,636 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 [] [2023-12-02 13:18:57,640 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 [] [2023-12-02 13:18:59,643 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 [] [2023-12-02 13:19:02,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:19:04,611 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 [] [2023-12-02 13:19:06,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:19:08,770 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 [] [2023-12-02 13:19:10,774 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 [] [2023-12-02 13:19:12,778 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 [] [2023-12-02 13:19:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:19:12,964 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2023-12-02 13:19:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:19:12,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:19:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:19:12,966 INFO L225 Difference]: With dead ends: 59 [2023-12-02 13:19:12,966 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 13:19:12,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=37, Invalid=58, Unknown=3, NotChecked=34, Total=132 [2023-12-02 13:19:12,967 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:19:12,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 11 Unknown, 135 Unchecked, 25.1s Time] [2023-12-02 13:19:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 13:19:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-12-02 13:19:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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) [2023-12-02 13:19:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-12-02 13:19:12,973 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 23 [2023-12-02 13:19:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:19:12,973 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-12-02 13:19:12,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:19:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-12-02 13:19:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:19:12,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:19:12,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:19:12,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 (8)] Ended with exit code 0 [2023-12-02 13:19:13,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:19:13,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:19:13,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:19:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -471975926, now seen corresponding path program 1 times [2023-12-02 13:19:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:19:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147595280] [2023-12-02 13:19:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:19:13,176 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 [2023-12-02 13:19:13,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:19:13,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:19:13,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 13:19:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:19:15,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 13:19:15,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:19:41,105 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 13:19:43,132 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-12-02 13:20:23,793 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 13:20:53,229 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from false [2023-12-02 13:20:55,259 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from true [2023-12-02 13:22:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:22:16,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:22:16,841 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:22:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147595280] [2023-12-02 13:22:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147595280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:22:16,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:22:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 13:22:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075448887] [2023-12-02 13:22:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:22:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 13:22:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:22:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 13:22:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=46, Unknown=5, NotChecked=48, Total=132 [2023-12-02 13:22:16,843 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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) [2023-12-02 13:22:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:22:22,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:22:25,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:22:27,666 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 [] [2023-12-02 13:22:29,669 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 [] [2023-12-02 13:22:31,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 13:22:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:22:31,916 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2023-12-02 13:22:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:22:31,917 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 24 [2023-12-02 13:22:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:22:31,919 INFO L225 Difference]: With dead ends: 61 [2023-12-02 13:22:31,919 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 13:22:31,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=39, Invalid=58, Unknown=5, NotChecked=54, Total=156 [2023-12-02 13:22:31,921 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:22:31,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 93 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 4 Unknown, 204 Unchecked, 14.9s Time] [2023-12-02 13:22:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 13:22:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2023-12-02 13:22:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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) [2023-12-02 13:22:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-12-02 13:22:31,927 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 24 [2023-12-02 13:22:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:22:31,927 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-12-02 13:22:31,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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) [2023-12-02 13:22:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-12-02 13:22:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 13:22:31,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:22:31,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:22:31,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 13:22:32,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 13:22:32,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:22:32,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:22:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash -962111539, now seen corresponding path program 1 times [2023-12-02 13:22:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:22:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846973427] [2023-12-02 13:22:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:22:32,131 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 [2023-12-02 13:22:32,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:22:32,132 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 13:22:32,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1122dcd-0366-4624-97ab-0c662fc02b07/bin/utaipan-verify-nQ1chXbOIh/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 (10)] Waiting until timeout for monitored process [2023-12-02 13:22:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:22:33,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 13:22:33,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:23:06,631 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_29| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse2))) (and (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_29| (fp.neg .cse0)) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_29| .cse0) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_29|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) |c_ULTIMATE.start_main_~main__S~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 13:24:08,734 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_29| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_29|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse2)) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_29| .cse2) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_29| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2023-12-02 13:24:10,764 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_29| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_29|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse2)) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_29| .cse2) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_29| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2023-12-02 13:25:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 13:25:43,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:25:50,141 WARN L854 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2023-12-02 13:25:52,196 WARN L876 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2023-12-02 13:26:06,666 WARN L854 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2023-12-02 13:26:08,726 WARN L876 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2023-12-02 13:26:23,417 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2023-12-02 13:27:26,720 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2023-12-02 13:27:41,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from false [2023-12-02 13:27:43,341 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from true [2023-12-02 13:28:06,256 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_23| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse1))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_23| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_23|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from false [2023-12-02 13:28:08,301 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_23| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse1))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_23| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_23|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from true [2023-12-02 13:29:13,146 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_23| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse1))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_23| (fp.neg .cse0))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_23|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from true [2023-12-02 13:29:36,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_23| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse3))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_23|) |ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse2)) (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse3)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse1)))))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)))))) is different from false [2023-12-02 13:29:38,123 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E0~0#1_23| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse3))) (or (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_23|) |ULTIMATE.start_main_~main__E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_23| .cse2)) (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse3)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse1)))))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2)))))) is different from true