./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E --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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:49:51,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:49:51,689 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:49:51,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:49:51,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:49:51,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:49:51,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:49:51,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:49:51,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:49:51,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:49:51,743 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:49:51,744 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:49:51,744 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:49:51,745 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:49:51,747 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:49:51,747 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:49:51,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:49:51,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:49:51,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:49:51,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:49:51,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:49:51,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:49:51,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:49:51,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:49:51,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:49:51,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:49:51,751 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:49:51,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:49:51,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:49:51,752 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:49:51,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:49:51,752 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-14 04:49:52,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:49:52,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:49:52,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:49:52,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:49:52,106 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:49:52,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/interpolation2.c Unable to find full path for "g++" [2024-11-14 04:49:54,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:49:54,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:49:54,327 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-14 04:49:54,334 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data/0b1470061/f0b2efea14334ac1af608c39fd9cd0f5/FLAG0ba6e1c57 [2024-11-14 04:49:54,349 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data/0b1470061/f0b2efea14334ac1af608c39fd9cd0f5 [2024-11-14 04:49:54,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:49:54,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:49:54,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:49:54,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:49:54,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:49:54,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1cdf80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54, skipping insertion in model container [2024-11-14 04:49:54,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:49:54,526 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_a3f18807-47a3-497d-b068-4179244a46cf/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-14 04:49:54,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:49:54,573 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:49:54,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_a3f18807-47a3-497d-b068-4179244a46cf/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-14 04:49:54,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:49:54,628 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:49:54,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54 WrapperNode [2024-11-14 04:49:54,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:49:54,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:49:54,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:49:54,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:49:54,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,681 INFO L138 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2024-11-14 04:49:54,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:49:54,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:49:54,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:49:54,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:49:54,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:49:54,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:49:54,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:49:54,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:49:54,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (1/1) ... [2024-11-14 04:49:54,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:49:54,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:49:54,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:49:54,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:49:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:49:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:49:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:49:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 04:49:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:49:54,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:49:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 04:49:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:49:54,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:49:54,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:49:55,108 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-14 04:49:55,111 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:49:55,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:49:55,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:49:55,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:55 BoogieIcfgContainer [2024-11-14 04:49:55,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:49:55,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:49:55,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:49:55,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:49:55,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:49:54" (1/3) ... [2024-11-14 04:49:55,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d01dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:49:55, skipping insertion in model container [2024-11-14 04:49:55,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:54" (2/3) ... [2024-11-14 04:49:55,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d01dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:49:55, skipping insertion in model container [2024-11-14 04:49:55,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:55" (3/3) ... [2024-11-14 04:49:55,228 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-14 04:49:55,247 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:49:55,248 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c that has 1 procedures, 9 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:49:55,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:49:55,312 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;@7bc043df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:49:55,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:49:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:49:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 04:49:55,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:55,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 04:49:55,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:49:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 82822056, now seen corresponding path program 1 times [2024-11-14 04:49:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774008799] [2024-11-14 04:49:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:55,597 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-14 04:49:55,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:49:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774008799] [2024-11-14 04:49:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774008799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:49:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:49:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:49:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255012038] [2024-11-14 04:49:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:49:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:49:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:49:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:49:55,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:49:55,638 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:49:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:55,673 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-14 04:49:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:49:55,676 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 04:49:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:55,682 INFO L225 Difference]: With dead ends: 22 [2024-11-14 04:49:55,683 INFO L226 Difference]: Without dead ends: 13 [2024-11-14 04:49:55,686 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-14 04:49:55,692 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:55,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:49:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-14 04:49:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2024-11-14 04:49:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:49:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-11-14 04:49:55,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2024-11-14 04:49:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:55,721 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-14 04:49:55,721 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:49:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2024-11-14 04:49:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:49:55,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:55,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:49:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:49:55,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:49:55,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1752600280, now seen corresponding path program 1 times [2024-11-14 04:49:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603598745] [2024-11-14 04:49:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:49:55,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:49:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:49:55,826 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:49:55,827 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:49:55,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:49:55,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:49:55,835 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-14 04:49:55,852 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:49:55,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:49:55 BoogieIcfgContainer [2024-11-14 04:49:55,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:49:55,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:49:55,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:49:55,857 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:49:55,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:55" (3/4) ... [2024-11-14 04:49:55,860 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:49:55,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:49:55,862 INFO L158 Benchmark]: Toolchain (without parser) took 1509.65ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 88.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-14 04:49:55,863 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:49:55,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.66ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 80.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:49:55,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.93ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:49:55,864 INFO L158 Benchmark]: Boogie Preprocessor took 38.59ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:49:55,864 INFO L158 Benchmark]: RCFGBuilder took 490.21ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 62.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:49:55,864 INFO L158 Benchmark]: TraceAbstraction took 639.36ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 89.2MB in the end (delta: -27.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-14 04:49:55,865 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 117.4MB. Free memory was 89.2MB in the beginning and 88.6MB in the end (delta: 560.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:49:55,867 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.66ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 80.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.93ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.59ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 490.21ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 62.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 639.36ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 89.2MB in the end (delta: -27.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 117.4MB. Free memory was 89.2MB in the beginning and 88.6MB in the end (delta: 560.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: 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 28, overapproximation of someBinaryFLOATComparisonOperation at line 21, overapproximation of someBinaryFLOATComparisonOperation at line 24, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={4:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={4:0}] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 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, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 9 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=9occurred 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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-14 04:49:55,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E --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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:49:58,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:49:59,048 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:49:59,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:49:59,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:49:59,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:49:59,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:49:59,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:49:59,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:49:59,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:49:59,109 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:49:59,110 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:49:59,110 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:49:59,110 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:49:59,111 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:49:59,111 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:49:59,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:49:59,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:49:59,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:49:59,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:49:59,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:49:59,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:49:59,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:49:59,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:49:59,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:49:59,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:49:59,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:49:59,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:49:59,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:49:59,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:49:59,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:49:59,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-14 04:49:59,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:49:59,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:49:59,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:49:59,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:49:59,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:49:59,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/interpolation2.c Unable to find full path for "g++" [2024-11-14 04:50:01,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:50:01,924 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:50:01,927 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-14 04:50:01,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data/24ca7a914/c9d42b82c8854b09b2b10a5e4cc461a7/FLAG1ac60d02b [2024-11-14 04:50:01,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/data/24ca7a914/c9d42b82c8854b09b2b10a5e4cc461a7 [2024-11-14 04:50:01,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:50:01,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:50:01,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:50:01,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:50:01,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:50:01,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:01" (1/1) ... [2024-11-14 04:50:01,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdaeb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:01, skipping insertion in model container [2024-11-14 04:50:01,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:01" (1/1) ... [2024-11-14 04:50:02,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:50:02,222 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_a3f18807-47a3-497d-b068-4179244a46cf/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-14 04:50:02,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:50:02,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:50:02,299 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_a3f18807-47a3-497d-b068-4179244a46cf/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-14 04:50:02,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:50:02,338 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:50:02,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02 WrapperNode [2024-11-14 04:50:02,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:50:02,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:50:02,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:50:02,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:50:02,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,386 INFO L138 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-14 04:50:02,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:50:02,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:50:02,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:50:02,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:50:02,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:50:02,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:50:02,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:50:02,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:50:02,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (1/1) ... [2024-11-14 04:50:02,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:50:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:50:02,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:50:02,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:50:02,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:50:02,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 04:50:02,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:50:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:50:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 04:50:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:50:02,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:50:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:50:02,632 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:50:02,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:50:05,118 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-14 04:50:05,119 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:50:05,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:50:05,129 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:50:05,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:05 BoogieIcfgContainer [2024-11-14 04:50:05,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:50:05,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:50:05,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:50:05,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:50:05,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:50:01" (1/3) ... [2024-11-14 04:50:05,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650da535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:05, skipping insertion in model container [2024-11-14 04:50:05,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:02" (2/3) ... [2024-11-14 04:50:05,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650da535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:05, skipping insertion in model container [2024-11-14 04:50:05,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:05" (3/3) ... [2024-11-14 04:50:05,150 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-14 04:50:05,164 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:50:05,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:50:05,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:50:05,231 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;@72081b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:50:05,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:50:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:50:05,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:50:05,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:50:05,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:50:05,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:50:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1236162952, now seen corresponding path program 1 times [2024-11-14 04:50:05,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:50:05,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535928441] [2024-11-14 04:50:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:05,260 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-14 04:50:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:50:05,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:05,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:05,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:50:05,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:50:05,851 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-14 04:50:05,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:50:05,852 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:50:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535928441] [2024-11-14 04:50:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535928441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:50:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:50:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:50:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574518044] [2024-11-14 04:50:05,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:50:05,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:50:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:50:05,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:50:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:50:05,890 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:50:05,903 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-14 04:50:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:50:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 04:50:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:50:05,914 INFO L225 Difference]: With dead ends: 27 [2024-11-14 04:50:05,914 INFO L226 Difference]: Without dead ends: 12 [2024-11-14 04:50:05,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:50:05,921 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:50:05,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:50:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-14 04:50:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-14 04:50:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-14 04:50:05,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-14 04:50:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:50:05,960 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-14 04:50:05,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-14 04:50:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:50:05,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:50:05,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:50:05,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:06,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:50:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:50:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1178904650, now seen corresponding path program 1 times [2024-11-14 04:50:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:50:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461183439] [2024-11-14 04:50:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:06,164 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-14 04:50:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:50:06,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:06,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:06,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:50:06,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:50:06,799 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-14 04:50:06,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:50:06,800 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:50:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461183439] [2024-11-14 04:50:06,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461183439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:50:06,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:50:06,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:50:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354188652] [2024-11-14 04:50:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:50:06,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:50:06,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:50:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:50:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:50:06,806 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:09,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:11,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:13,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:50:13,283 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-14 04:50:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:50:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 04:50:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:50:13,331 INFO L225 Difference]: With dead ends: 19 [2024-11-14 04:50:13,331 INFO L226 Difference]: Without dead ends: 15 [2024-11-14 04:50:13,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-14 04:50:13,332 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:50:13,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2024-11-14 04:50:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-14 04:50:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-11-14 04:50:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-14 04:50:13,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-14 04:50:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:50:13,338 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-14 04:50:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:50:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-14 04:50:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:50:13,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:50:13,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:50:13,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:50:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:13,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:50:13,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:50:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2110326903, now seen corresponding path program 1 times [2024-11-14 04:50:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:50:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28722492] [2024-11-14 04:50:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:13,544 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-14 04:50:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:50:13,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:13,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:50:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:14,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:50:14,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:50:24,007 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-14 04:50:24,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 612 treesize of output 312 [2024-11-14 04:53:25,967 WARN L851 $PredicateComparison]: unable to prove that (or (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-14 04:53:54,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) is different from false [2024-11-14 04:53:56,398 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) is different from true [2024-11-14 04:53:56,398 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-14 04:53:56,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:53:56,399 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:53:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28722492] [2024-11-14 04:53:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28722492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:53:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:53:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 04:53:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563280092] [2024-11-14 04:53:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:53:56,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:53:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:53:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:53:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2024-11-14 04:53:56,400 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:53:59,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:01,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:03,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:05,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:06,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:09,004 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 .cse3) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse4 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse4) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse6)) (fp.sub roundNearestTiesToEven .cse4 .cse6))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse6 .cse7))))))))))))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse8) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse9 .cse5) (exists ((|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse9) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse10) (not (fp.geq (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse10)) (fp.sub roundNearestTiesToEven .cse9 .cse10))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (= .cse10 .cse7))))))))) (= .cse11 .cse3))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-14 04:54:11,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:13,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:15,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:17,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:19,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:21,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:21,242 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-14 04:54:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:54:21,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:54:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:21,244 INFO L225 Difference]: With dead ends: 25 [2024-11-14 04:54:21,244 INFO L226 Difference]: Without dead ends: 21 [2024-11-14 04:54:21,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=35, Invalid=63, Unknown=4, NotChecked=54, Total=156 [2024-11-14 04:54:21,247 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:21,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 10 Unknown, 60 Unchecked, 22.7s Time] [2024-11-14 04:54:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-14 04:54:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-14 04:54:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:54:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-14 04:54:21,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-11-14 04:54:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:21,252 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-14 04:54:21,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:54:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-14 04:54:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:54:21,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:21,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:21,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 04:54:21,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:54:21,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:54:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1504582023, now seen corresponding path program 1 times [2024-11-14 04:54:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:54:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062747388] [2024-11-14 04:54:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:21,455 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-14 04:54:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:54:21,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:54:21,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:54:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:21,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:54:21,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:54:21,943 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-14 04:54:21,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:54:21,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:54:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062747388] [2024-11-14 04:54:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062747388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:54:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556173955] [2024-11-14 04:54:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:21,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:54:21,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:54:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:54:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:54:21,945 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:54:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:22,037 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-14 04:54:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:54:22,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:54:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:22,039 INFO L225 Difference]: With dead ends: 24 [2024-11-14 04:54:22,039 INFO L226 Difference]: Without dead ends: 14 [2024-11-14 04:54:22,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:54:22,040 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:22,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:54:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-14 04:54:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-14 04:54:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:54:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-14 04:54:22,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2024-11-14 04:54:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:22,045 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-14 04:54:22,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:54:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-14 04:54:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:54:22,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:22,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:22,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 04:54:22,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:54:22,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:54:22,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 997140987, now seen corresponding path program 1 times [2024-11-14 04:54:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:54:22,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520319622] [2024-11-14 04:54:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:22,248 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-14 04:54:22,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:54:22,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:54:22,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 04:54:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:22,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:54:22,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:54:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:54:22,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:54:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:54:22,958 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:54:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520319622] [2024-11-14 04:54:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520319622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:54:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [470534990] [2024-11-14 04:54:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:22,958 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:54:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:54:22,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:54:22,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-14 04:54:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:23,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:54:23,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:54:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:54:23,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:54:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:54:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [470534990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:54:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602483598] [2024-11-14 04:54:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:23,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:54:23,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:54:23,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:54:23,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:54:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:24,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:54:24,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:54:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:54:24,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:54:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:54:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602483598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:54:24,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:54:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2024-11-14 04:54:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549710233] [2024-11-14 04:54:24,319 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:54:24,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:54:24,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:54:24,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:54:24,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:54:24,320 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:54:26,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:28,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:30,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:32,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:34,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:36,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:38,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:40,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:42,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:44,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:46,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:48,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:51,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:53,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:55,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:57,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:54:59,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:01,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:03,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:05,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:07,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:09,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:11,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:13,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:55:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:55:13,281 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-14 04:55:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:55:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:55:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:55:13,331 INFO L225 Difference]: With dead ends: 26 [2024-11-14 04:55:13,331 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 04:55:13,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:55:13,332 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:55:13,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 24 Unknown, 0 Unchecked, 48.9s Time] [2024-11-14 04:55:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 04:55:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-14 04:55:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:55:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-14 04:55:13,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2024-11-14 04:55:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:55:13,338 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-14 04:55:13,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:55:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-14 04:55:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:55:13,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:55:13,339 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:55:13,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 04:55:13,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:55:13,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-14 04:55:13,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:55:13,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:55:13,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:55:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash 848264914, now seen corresponding path program 1 times [2024-11-14 04:55:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:55:13,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986593576] [2024-11-14 04:55:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:13,941 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-14 04:55:13,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:55:13,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/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-14 04:55:13,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f18807-47a3-497d-b068-4179244a46cf/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 04:55:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:14,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:55:14,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:55:26,740 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 04:55:26,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 659 treesize of output 335 [2024-11-14 05:00:11,980 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse8 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse2)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse5) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse7)) (fp.sub roundNearestTiesToEven .cse5 .cse7))) .cse8))))) (= .cse3 .cse7)))) (= .cse6 .cse9)))))))))))) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse10) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse11 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse12) (not (fp.leq (fp.add roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse14)) (fp.sub roundNearestTiesToEven .cse12 .cse14))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse12)))) (= .cse3 .cse14)))) (= .cse13 .cse9)))) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse11)))))))))))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse17 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse16 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse18 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (= .cse15 .cse3) (= .cse4 .cse16) (= .cse0 .cse17) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse15)) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse16) (= .cse3 .cse18) (= .cse19 .cse9) (fp.geq (fp.add roundNearestTiesToEven .cse19 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse18)) (fp.sub roundNearestTiesToEven .cse16 .cse18))) .cse8)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2024-11-14 05:00:42,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse2)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse5) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse7)) (fp.sub roundNearestTiesToEven .cse5 .cse7))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (= .cse3 .cse7)))) (= .cse6 .cse8)))))))))))) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse9) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse10 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse11) (not (fp.leq (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse13)) (fp.sub roundNearestTiesToEven .cse11 .cse13))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse11)))) (= .cse3 .cse13)))) (= .cse12 .cse8)))) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse10)))))))))))) is different from false [2024-11-14 05:00:44,267 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))) (or (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse2)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse5) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse7)) (fp.sub roundNearestTiesToEven .cse5 .cse7))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (= .cse3 .cse7)))) (= .cse6 .cse8)))))))))))) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse9) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse10 .cse3) (exists ((|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse4 .cse11) (not (fp.leq (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse13)) (fp.sub roundNearestTiesToEven .cse11 .cse13))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse11)))) (= .cse3 .cse13)))) (= .cse12 .cse8)))) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse10)))))))))))) is different from true [2024-11-14 05:00:44,268 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-14 05:00:44,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:00:55,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) is different from false [2024-11-14 05:00:57,084 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) is different from true [2024-11-14 05:01:11,847 WARN L851 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))) is different from false [2024-11-14 05:01:13,907 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))) is different from true [2024-11-14 05:01:28,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))))) is different from false [2024-11-14 05:01:30,680 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0))))))) is different from true [2024-11-14 05:01:49,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from false [2024-11-14 05:01:51,685 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from true [2024-11-14 05:02:10,586 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (let ((.cse9 (select .cse1 (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse7 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))))) is different from false [2024-11-14 05:02:12,647 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (let ((.cse9 (select .cse1 (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse7 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))))) is different from true [2024-11-14 05:02:31,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-14 05:02:33,744 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-14 05:02:56,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-14 05:02:58,986 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-14 05:03:22,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from false [2024-11-14 05:03:24,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse8 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-14 05:03:51,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse9 (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse0 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))))) is different from false [2024-11-14 05:03:53,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse9 (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse0 .cse6)))))) (and (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))))) is different from true