./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:33:29,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:33:29,493 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:33:29,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:33:29,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:33:29,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:33:29,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:33:29,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:33:29,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:33:29,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:33:29,541 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:33:29,542 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:33:29,542 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:33:29,542 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:33:29,543 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:33:29,543 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:33:29,543 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:33:29,544 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:33:29,544 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:33:29,544 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:33:29,545 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:33:29,549 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:33:29,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:33:29,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:33:29,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:33:29,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:33:29,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:33:29,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:33:29,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:33:29,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:33:29,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:33:29,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:33:29,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:33:29,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:33:29,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:33:29,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:33:29,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:33:29,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:33:29,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:33:29,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:33:29,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:33:29,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:33:29,563 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:33:29,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:33:29,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:33:29,564 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:33:29,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:33:29,565 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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2024-11-09 06:33:29,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:33:29,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:33:29,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:33:29,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:33:29,889 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:33:29,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/zonotope_2.c Unable to find full path for "g++" [2024-11-09 06:33:32,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:33:32,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:33:32,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/sv-benchmarks/c/float-benchs/zonotope_2.c [2024-11-09 06:33:32,213 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data/f23b9d25f/b8a34081f52243b3a7f24c8b79c54150/FLAGcbd8d9cbc [2024-11-09 06:33:32,237 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data/f23b9d25f/b8a34081f52243b3a7f24c8b79c54150 [2024-11-09 06:33:32,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:33:32,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:33:32,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:33:32,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:33:32,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:33:32,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e23ce78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32, skipping insertion in model container [2024-11-09 06:33:32,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:33:32,535 WARN L250 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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-09 06:33:32,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:33:32,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:33:32,585 WARN L250 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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-09 06:33:32,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:33:32,613 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:33:32,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32 WrapperNode [2024-11-09 06:33:32,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:33:32,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:33:32,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:33:32,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:33:32,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,654 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2024-11-09 06:33:32,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:33:32,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:33:32,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:33:32,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:33:32,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:33:32,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:33:32,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:33:32,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:33:32,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (1/1) ... [2024-11-09 06:33:32,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:33:32,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:32,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:33:32,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:33:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:33:32,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:33:32,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:33:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:33:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:33:32,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:33:32,859 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:33:32,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:33:33,021 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 06:33:33,021 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:33:33,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:33:33,058 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:33:33,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:33 BoogieIcfgContainer [2024-11-09 06:33:33,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:33:33,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:33:33,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:33:33,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:33:33,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:33:32" (1/3) ... [2024-11-09 06:33:33,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199d296e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:33, skipping insertion in model container [2024-11-09 06:33:33,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:32" (2/3) ... [2024-11-09 06:33:33,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199d296e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:33, skipping insertion in model container [2024-11-09 06:33:33,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:33" (3/3) ... [2024-11-09 06:33:33,075 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2024-11-09 06:33:33,097 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:33:33,097 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:33:33,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:33:33,185 INFO L333 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, 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;@48e4260f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:33:33,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:33:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:33:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 06:33:33,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:33,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 06:33:33,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:33:33,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2048601052, now seen corresponding path program 1 times [2024-11-09 06:33:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:33,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528605436] [2024-11-09 06:33:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:33,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:33:33,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528605436] [2024-11-09 06:33:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528605436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:33,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509216945] [2024-11-09 06:33:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:33,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:33,430 INFO L87 Difference]: Start difference. First operand has 15 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:33:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:33,479 INFO L93 Difference]: Finished difference Result 34 states and 51 transitions. [2024-11-09 06:33:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 06:33:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:33,496 INFO L225 Difference]: With dead ends: 34 [2024-11-09 06:33:33,497 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 06:33:33,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:33,506 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:33,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:33:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 06:33:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-11-09 06:33:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:33:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-09 06:33:33,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 6 [2024-11-09 06:33:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:33,556 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-09 06:33:33,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:33:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-09 06:33:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:33:33,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:33,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:33:33,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:33:33,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:33:33,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1228778621, now seen corresponding path program 1 times [2024-11-09 06:33:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138182926] [2024-11-09 06:33:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:33:33,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:33:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:33:33,634 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:33:33,634 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:33:33,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 06:33:33,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:33:33,640 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 06:33:33,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:33:33,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:33:33 BoogieIcfgContainer [2024-11-09 06:33:33,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:33:33,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:33:33,661 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:33:33,661 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:33:33,662 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:33" (3/4) ... [2024-11-09 06:33:33,665 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:33:33,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:33:33,667 INFO L158 Benchmark]: Toolchain (without parser) took 1425.18ms. Allocated memory is still 146.8MB. Free memory was 108.3MB in the beginning and 105.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-09 06:33:33,667 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 111.1MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:33:33,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.72ms. Allocated memory is still 146.8MB. Free memory was 108.3MB in the beginning and 95.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 06:33:33,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.64ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 94.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:33:33,669 INFO L158 Benchmark]: Boogie Preprocessor took 35.65ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 93.6MB in the end (delta: 962.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:33:33,669 INFO L158 Benchmark]: RCFGBuilder took 367.17ms. Allocated memory is still 146.8MB. Free memory was 93.1MB in the beginning and 83.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 06:33:33,670 INFO L158 Benchmark]: TraceAbstraction took 597.96ms. Allocated memory is still 146.8MB. Free memory was 82.1MB in the beginning and 105.5MB in the end (delta: -23.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:33:33,670 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 146.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:33:33,673 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.31ms. Allocated memory is still 111.1MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.72ms. Allocated memory is still 146.8MB. Free memory was 108.3MB in the beginning and 95.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.64ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 94.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.65ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 93.6MB in the end (delta: 962.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.17ms. Allocated memory is still 146.8MB. Free memory was 93.1MB in the beginning and 83.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 597.96ms. Allocated memory is still 146.8MB. Free memory was 82.1MB in the beginning and 105.5MB in the end (delta: -23.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 146.8MB. Free memory is still 105.5MB. 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: 10]: 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 someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x1=12, y1=16] [L19] COND FALSE !(i < 100000) VAL [i=0, x1=12, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0] [L10] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 13 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 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 [2024-11-09 06:33:33,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:33:36,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:33:36,337 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:33:36,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:33:36,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:33:36,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:33:36,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:33:36,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:33:36,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:33:36,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:33:36,385 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:33:36,385 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:33:36,386 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:33:36,386 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:33:36,386 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:33:36,389 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:33:36,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:33:36,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:33:36,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:33:36,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:33:36,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:33:36,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:33:36,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:33:36,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:33:36,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:33:36,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:33:36,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:33:36,397 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:33:36,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:33:36,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:33:36,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:33:36,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:33:36,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:33:36,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:33:36,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:33:36,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:33:36,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:33:36,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:33:36,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:33:36,403 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:33:36,403 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:33:36,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:33:36,406 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:33:36,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2024-11-09 06:33:36,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:33:36,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:33:36,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:33:36,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:33:36,868 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:33:36,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/zonotope_2.c Unable to find full path for "g++" [2024-11-09 06:33:38,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:33:39,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:33:39,254 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/sv-benchmarks/c/float-benchs/zonotope_2.c [2024-11-09 06:33:39,262 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data/b58eed549/a6fb8ffa73924d089c8bd059bf96f0f2/FLAG7da3ed4ff [2024-11-09 06:33:39,579 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/data/b58eed549/a6fb8ffa73924d089c8bd059bf96f0f2 [2024-11-09 06:33:39,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:33:39,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:33:39,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:33:39,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:33:39,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:33:39,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696c849b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39, skipping insertion in model container [2024-11-09 06:33:39,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:33:39,837 WARN L250 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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-09 06:33:39,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:33:39,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:33:39,886 WARN L250 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_31bc0d67-b3a8-421a-9dca-11a3c6683b60/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-09 06:33:39,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:33:39,912 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:33:39,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39 WrapperNode [2024-11-09 06:33:39,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:33:39,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:33:39,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:33:39,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:33:39,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,952 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-09 06:33:39,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:33:39,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:33:39,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:33:39,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:33:39,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:33:39,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:33:39,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:33:39,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:33:39,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (1/1) ... [2024-11-09 06:33:39,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:33:40,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:40,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:33:40,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:33:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:33:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:33:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:33:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:33:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:33:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:33:40,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:33:40,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:33:42,489 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 06:33:42,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:33:42,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:33:42,502 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:33:42,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:42 BoogieIcfgContainer [2024-11-09 06:33:42,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:33:42,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:33:42,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:33:42,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:33:42,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:33:39" (1/3) ... [2024-11-09 06:33:42,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c4581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:42, skipping insertion in model container [2024-11-09 06:33:42,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39" (2/3) ... [2024-11-09 06:33:42,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c4581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:42, skipping insertion in model container [2024-11-09 06:33:42,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:42" (3/3) ... [2024-11-09 06:33:42,514 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2024-11-09 06:33:42,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:33:42,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:33:42,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:33:42,622 INFO L333 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, 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;@5b556d72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:33:42,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:33:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:33:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:33:42,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:42,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:33:42,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:33:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2024-11-09 06:33:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:33:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050867620] [2024-11-09 06:33:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:42,658 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 [2024-11-09 06:33:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:33:42,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 06:33:42,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:33:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:42,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:33:42,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:33:42,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:33:42,835 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:33:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050867620] [2024-11-09 06:33:42,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050867620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:42,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:42,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:33:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927491850] [2024-11-09 06:33:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:42,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:33:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:42,877 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:33:45,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:33:47,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:33:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:47,211 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2024-11-09 06:33:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:33:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:47,221 INFO L225 Difference]: With dead ends: 39 [2024-11-09 06:33:47,221 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 06:33:47,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:47,227 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:47,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 06:33:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 06:33:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2024-11-09 06:33:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:33:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-09 06:33:47,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2024-11-09 06:33:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 06:33:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:33:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-09 06:33:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:33:47,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:47,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:33:47,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 06:33:47,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:33:47,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:33:47,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash 150522367, now seen corresponding path program 1 times [2024-11-09 06:33:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:33:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929221070] [2024-11-09 06:33:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:47,479 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 [2024-11-09 06:33:47,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:33:47,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 06:33:47,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:33:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:47,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:33:47,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:33:49,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:33:49,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:33:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929221070] [2024-11-09 06:33:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929221070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:33:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577331281] [2024-11-09 06:33:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:33:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:33:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:33:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:33:49,517 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:33:51,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:33:54,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:33:56,442 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 [] [2024-11-09 06:33:58,447 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 [] [2024-11-09 06:34:00,450 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 [] [2024-11-09 06:34:02,456 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 [] [2024-11-09 06:34:04,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:34:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:34:04,666 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-09 06:34:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:34:04,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 06:34:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:34:04,702 INFO L225 Difference]: With dead ends: 28 [2024-11-09 06:34:04,702 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 06:34:04,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:34:04,705 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:34:04,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 6 Unknown, 0 Unchecked, 15.0s Time] [2024-11-09 06:34:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 06:34:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-11-09 06:34:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:34:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 06:34:04,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 8 [2024-11-09 06:34:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:34:04,718 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 06:34:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:34:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 06:34:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:34:04,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:34:04,720 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:34:04,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 06:34:04,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:34:04,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:34:04,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:34:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1773801895, now seen corresponding path program 1 times [2024-11-09 06:34:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:34:04,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600862170] [2024-11-09 06:34:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:04,923 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 [2024-11-09 06:34:04,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:34:04,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 06:34:04,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:34:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:05,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:34:05,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:34:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:34:06,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:17,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-09 06:34:19,401 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-09 06:34:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:34:27,599 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:34:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600862170] [2024-11-09 06:34:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600862170] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:34:27,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:34:27,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-09 06:34:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355684109] [2024-11-09 06:34:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:34:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:34:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:34:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:34:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2024-11-09 06:34:27,603 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:34:29,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from false [2024-11-09 06:34:31,654 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from true [2024-11-09 06:34:33,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:34:35,940 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 [] [2024-11-09 06:34:37,945 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 [] [2024-11-09 06:34:39,949 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 [] [2024-11-09 06:34:42,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:34:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:34:42,100 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-09 06:34:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:34:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 06:34:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:34:42,133 INFO L225 Difference]: With dead ends: 32 [2024-11-09 06:34:42,133 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 06:34:42,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2024-11-09 06:34:42,137 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:34:42,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 5 Unknown, 37 Unchecked, 10.4s Time] [2024-11-09 06:34:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 06:34:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-09 06:34:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:34:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-09 06:34:42,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2024-11-09 06:34:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:34:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-09 06:34:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:34:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-09 06:34:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:34:42,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:34:42,150 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:34:42,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:34:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:34:42,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:34:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:34:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -504072255, now seen corresponding path program 1 times [2024-11-09 06:34:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:34:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364820231] [2024-11-09 06:34:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:42,353 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 [2024-11-09 06:34:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:34:42,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 06:34:42,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:34:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:42,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:34:42,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:34:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:34:42,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:34:42,951 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:34:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364820231] [2024-11-09 06:34:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364820231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:34:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [279759570] [2024-11-09 06:34:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:42,952 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:34:42,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:34:42,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:34:42,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 06:34:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:43,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:34:43,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:34:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:34:43,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:34:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [279759570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:34:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585527387] [2024-11-09 06:34:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:34:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:34:43,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:34:43,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:34:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:43,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:34:43,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:34:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:34:43,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:34:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585527387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:34:44,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:34:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2024-11-09 06:34:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937035110] [2024-11-09 06:34:44,075 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:34:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:34:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:34:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:34:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:34:44,078 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:34:46,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:34:48,175 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 [] [2024-11-09 06:34:50,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:34:52,343 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 [] [2024-11-09 06:34:54,558 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 [] [2024-11-09 06:34:56,565 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 [] [2024-11-09 06:34:58,568 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 [] [2024-11-09 06:35:00,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:35:02,714 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 [] [2024-11-09 06:35:04,719 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 [] [2024-11-09 06:35:06,722 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 [] [2024-11-09 06:35:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:35:06,779 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-11-09 06:35:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:35:06,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-09 06:35:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:35:06,781 INFO L225 Difference]: With dead ends: 45 [2024-11-09 06:35:06,781 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 06:35:06,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:35:06,783 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:35:06,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 11 Unknown, 0 Unchecked, 22.6s Time] [2024-11-09 06:35:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 06:35:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 06:35:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:35:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-09 06:35:06,795 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 20 [2024-11-09 06:35:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:35:06,796 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-09 06:35:06,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:35:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-09 06:35:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:35:06,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:35:06,797 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:35:06,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-09 06:35:07,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:35:07,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:35:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:35:07,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:35:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:35:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1242727486, now seen corresponding path program 1 times [2024-11-09 06:35:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:35:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206457730] [2024-11-09 06:35:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:35:07,400 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 [2024-11-09 06:35:07,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:35:07,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 06:35:07,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:35:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:35:07,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:35:07,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:35:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:35:13,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:35:24,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2024-11-09 06:35:26,296 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2024-11-09 06:36:09,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-09 06:36:11,563 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-09 06:36:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-09 06:36:20,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:36:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206457730] [2024-11-09 06:36:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206457730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:36:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666726126] [2024-11-09 06:36:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:36:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:36:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:36:20,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:36:20,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 06:36:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:36:20,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:36:20,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:36:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:36:21,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:37:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-09 06:37:17,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [666726126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:37:17,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187753634] [2024-11-09 06:37:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:37:17,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:37:17,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:37:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:27,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:37:27,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:37:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:37:28,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:38:10,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))))) is different from false [2024-11-09 06:38:12,072 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))))) is different from true [2024-11-09 06:38:38,588 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from true [2024-11-09 06:39:13,203 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (let ((.cse3 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2)))))))) is different from true [2024-11-09 06:39:36,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from false [2024-11-09 06:39:38,616 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from true [2024-11-09 06:41:47,098 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))))) is different from true [2024-11-09 06:43:55,328 WARN L851 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))))) is different from false [2024-11-09 06:43:57,426 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))))) is different from true [2024-11-09 06:44:20,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from false [2024-11-09 06:44:22,991 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from true [2024-11-09 06:44:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-11-09 06:44:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187753634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:44:44,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:44:44,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 13] total 22 [2024-11-09 06:44:44,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055503704] [2024-11-09 06:44:44,239 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:44:44,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:44:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:44:44,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:44:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=123, Unknown=17, NotChecked=270, Total=462 [2024-11-09 06:44:44,242 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 22 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:44:46,314 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 [] [2024-11-09 06:44:48,386 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 [] [2024-11-09 06:44:50,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2024-11-09 06:44:52,491 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2024-11-09 06:44:55,725 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse5 (fp.leq .cse4 .cse6))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) .cse5 (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse6)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse6)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) .cse5))))) is different from true [2024-11-09 06:44:57,940 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse1 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse3 .cse2)) (fp.geq .cse3 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (or .cse0 (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse1) (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-09 06:45:00,157 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (not (fp.leq .cse2 .cse1)) (fp.geq .cse2 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse1) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse1))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) .cse1)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse0) .cse0 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) .cse1)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-09 06:45:03,306 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.geq .cse7 (_ +zero 8 24))) (.cse6 (fp.leq .cse7 .cse5))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) .cse4 (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse5)) (and .cse4 .cse6) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) .cse6 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-09 06:45:13,359 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-09 06:45:15,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:45:16,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:45:19,931 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse1 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse3 .cse2)) (fp.geq .cse3 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (or .cse0 (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse1) (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) .cse1 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (= (_ bv1 32) c___VERIFIER_assert_~cond) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-09 06:45:22,142 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 [] [2024-11-09 06:45:24,146 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 [] [2024-11-09 06:45:26,148 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 [] [2024-11-09 06:45:28,152 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 [] [2024-11-09 06:45:30,155 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 [] [2024-11-09 06:45:32,161 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 [] [2024-11-09 06:45:34,164 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 [] [2024-11-09 06:45:36,168 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 [] [2024-11-09 06:45:38,170 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 [] [2024-11-09 06:45:40,175 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 [] [2024-11-09 06:45:42,178 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 [] [2024-11-09 06:45:44,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:45:46,376 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 [] [2024-11-09 06:45:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:46,571 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-09 06:45:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:45:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 21 [2024-11-09 06:45:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:46,580 INFO L225 Difference]: With dead ends: 42 [2024-11-09 06:45:46,580 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 06:45:46,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 64.2s TimeCoverageRelationStatistics Valid=72, Invalid=149, Unknown=25, NotChecked=624, Total=870 [2024-11-09 06:45:46,582 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:46,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 16 Unknown, 444 Unchecked, 35.0s Time] [2024-11-09 06:45:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 06:45:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 06:45:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:45:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-09 06:45:46,598 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 21 [2024-11-09 06:45:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:46,599 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-09 06:45:46,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:45:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-09 06:45:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:45:46,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:46,601 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:46,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 06:45:46,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-09 06:45:47,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:45:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:45:47,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:45:47,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash -307117190, now seen corresponding path program 2 times [2024-11-09 06:45:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:45:47,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817506275] [2024-11-09 06:45:47,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:45:47,206 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 [2024-11-09 06:45:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:45:47,210 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 06:45:47,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/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 (11)] Waiting until timeout for monitored process [2024-11-09 06:45:47,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:45:47,671 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:45:47,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:45:47,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:45:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:45:55,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:46:06,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-09 06:46:08,737 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-09 06:46:52,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-09 06:46:54,248 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-09 06:47:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2024-11-09 06:47:02,847 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:47:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817506275] [2024-11-09 06:47:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817506275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:47:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1614886290] [2024-11-09 06:47:02,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:47:02,848 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:47:02,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:47:02,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:47:02,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-09 06:47:03,652 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:47:03,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:47:03,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:47:03,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:47:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:47:05,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:48:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2024-11-09 06:48:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1614886290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:48:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876958851] [2024-11-09 06:48:01,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:48:01,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:48:01,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:48:01,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:48:01,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bc0d67-b3a8-421a-9dca-11a3c6683b60/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:48:24,179 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:48:24,179 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:48:24,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:48:24,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:48:54,250 WARN L851 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~x1~0#1_45| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.geq |v_ULTIMATE.start_main_~x1~0#1_45| (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_45|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_45| .cse1)) |c_ULTIMATE.start_main_~x1~0#1|) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_45| .cse2) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_45| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse1))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_45| .cse2) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24)))))) is different from false