./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i --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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 ae3082e6816ab7154f1817fbd0925b1957ee0101c78958f1f0ff24c3b37d011b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:51:58,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:51:59,015 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:51:59,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:51:59,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:51:59,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:51:59,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:51:59,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:51:59,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:51:59,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:51:59,062 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:51:59,062 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:51:59,062 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:51:59,062 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:51:59,062 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:51:59,063 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:51:59,063 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:51:59,063 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:51:59,063 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:51:59,063 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:51:59,063 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:51:59,063 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:51:59,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:51:59,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:51:59,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:51:59,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:51:59,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:51:59,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:51:59,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:51:59,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:51:59,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:51:59,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:51:59,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:51:59,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:51:59,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:51:59,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:51:59,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:51:59,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:51:59,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:51:59,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:51:59,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:51:59,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:51:59,067 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:51:59,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:51:59,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:51:59,068 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:51:59,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:51:59,068 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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 -> ae3082e6816ab7154f1817fbd0925b1957ee0101c78958f1f0ff24c3b37d011b [2024-11-14 04:51:59,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:51:59,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:51:59,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:51:59,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:51:59,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:51:59,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i Unable to find full path for "g++" [2024-11-14 04:52:01,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:52:01,844 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:52:01,845 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i [2024-11-14 04:52:01,854 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data/5ba116746/6e41123683034c5783120b9f8ab5e5da/FLAGbc4f26b90 [2024-11-14 04:52:01,870 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data/5ba116746/6e41123683034c5783120b9f8ab5e5da [2024-11-14 04:52:01,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:52:01,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:52:01,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:52:01,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:52:01,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:52:01,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:01" (1/1) ... [2024-11-14 04:52:01,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2e7e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:01, skipping insertion in model container [2024-11-14 04:52:01,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:01" (1/1) ... [2024-11-14 04:52:01,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:52:02,084 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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i[916,929] [2024-11-14 04:52:02,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:52:02,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:52:02,206 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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i[916,929] [2024-11-14 04:52:02,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:52:02,304 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:52:02,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02 WrapperNode [2024-11-14 04:52:02,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:52:02,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:52:02,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:52:02,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:52:02,320 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:52:02" (1/1) ... [2024-11-14 04:52:02,345 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:52:02" (1/1) ... [2024-11-14 04:52:02,418 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-11-14 04:52:02,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:52:02,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:52:02,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:52:02,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:52:02,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:52:02,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:52:02,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:52:02,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:52:02,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (1/1) ... [2024-11-14 04:52:02,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:52:02,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:52:02,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:02,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:52:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:52:02,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:52:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:52:02,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:52:02,764 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:52:02,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:52:03,524 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-14 04:52:03,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:52:04,278 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:52:04,279 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:52:04,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:04 BoogieIcfgContainer [2024-11-14 04:52:04,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:52:04,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:52:04,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:52:04,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:52:04,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:52:01" (1/3) ... [2024-11-14 04:52:04,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c263ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:04, skipping insertion in model container [2024-11-14 04:52:04,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:02" (2/3) ... [2024-11-14 04:52:04,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c263ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:04, skipping insertion in model container [2024-11-14 04:52:04,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:04" (3/3) ... [2024-11-14 04:52:04,289 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-29.i [2024-11-14 04:52:04,307 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:52:04,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-29.i that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:52:04,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:52:04,388 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;@484b27ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:52:04,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:52:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:52:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 04:52:04,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:52:04,402 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:52:04,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:52:04,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:52:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 457729529, now seen corresponding path program 1 times [2024-11-14 04:52:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:52:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185974341] [2024-11-14 04:52:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:52:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:52:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:52:06,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:52:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:52:06,863 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:52:06,865 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:52:06,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:52:06,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:52:06,874 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:52:06,981 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:52:06,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:52:06 BoogieIcfgContainer [2024-11-14 04:52:06,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:52:06,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:52:06,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:52:06,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:52:06,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:04" (3/4) ... [2024-11-14 04:52:06,993 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:52:06,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:52:06,995 INFO L158 Benchmark]: Toolchain (without parser) took 5121.40ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 93.6MB in the beginning and 253.8MB in the end (delta: -160.2MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2024-11-14 04:52:06,996 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:52:06,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.44ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 79.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:52:06,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.79ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:52:06,997 INFO L158 Benchmark]: Boogie Preprocessor took 39.71ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:52:06,998 INFO L158 Benchmark]: RCFGBuilder took 1820.93ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 74.6MB in the beginning and 318.1MB in the end (delta: -243.4MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-14 04:52:06,998 INFO L158 Benchmark]: TraceAbstraction took 2703.20ms. Allocated memory is still 352.3MB. Free memory was 317.4MB in the beginning and 253.9MB in the end (delta: 63.5MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2024-11-14 04:52:06,999 INFO L158 Benchmark]: Witness Printer took 8.19ms. Allocated memory is still 352.3MB. Free memory was 253.9MB in the beginning and 253.8MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:52:07,001 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.44ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 79.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.79ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.71ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1820.93ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 74.6MB in the beginning and 318.1MB in the end (delta: -243.4MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2703.20ms. Allocated memory is still 352.3MB. Free memory was 317.4MB in the beginning and 253.9MB in the end (delta: 63.5MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. * Witness Printer took 8.19ms. Allocated memory is still 352.3MB. Free memory was 253.9MB in the beginning and 253.8MB in the end (delta: 44.9kB). 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: 19]: 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 75, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someUnaryFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] float var_1_3 = 9.3; [L25] float* var_1_3_Pointer = &(var_1_3); [L26] float var_1_4 = 3.4; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] unsigned short int var_1_5 = 32; [L29] unsigned short int* var_1_5_Pointer = &(var_1_5); [L30] unsigned short int var_1_9 = 1; [L31] unsigned short int* var_1_9_Pointer = &(var_1_9); [L32] unsigned char var_1_10 = 8; [L33] unsigned char* var_1_10_Pointer = &(var_1_10); [L34] unsigned char var_1_11 = 5; [L35] unsigned char* var_1_11_Pointer = &(var_1_11); [L36] unsigned char var_1_12 = 1; [L37] unsigned char* var_1_12_Pointer = &(var_1_12); [L38] unsigned char var_1_13 = 1; [L39] unsigned char* var_1_13_Pointer = &(var_1_13); [L40] unsigned char var_1_14 = 8; [L41] unsigned char* var_1_14_Pointer = &(var_1_14); [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_float() [L73] EXPR \read(var_1_3) [L73] EXPR var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F [L73] EXPR (var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ) [L73] EXPR \read(var_1_3) [L73] EXPR var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F [L73] EXPR \read(var_1_3) [L73] EXPR var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F [L73] EXPR (var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L73] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L74] var_1_4 = __VERIFIER_nondet_float() [L75] EXPR \read(var_1_4) [L75] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F [L75] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) [L75] EXPR \read(var_1_4) [L75] EXPR var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F [L75] EXPR \read(var_1_4) [L75] EXPR var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F [L75] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] var_1_11 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] RET updateVariables() [L95] CALL step() [L45] EXPR \read(*var_1_13_Pointer) [L45] (*(var_1_12_Pointer)) = (*(var_1_13_Pointer)) [L46] EXPR \read(*var_1_11_Pointer) [L46] (*(var_1_14_Pointer)) = (*(var_1_11_Pointer)) [L47] EXPR \read(*var_1_12_Pointer) [L47] COND TRUE (*(var_1_12_Pointer)) [L48] EXPR \read(*var_1_3_Pointer) [L48] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L54] EXPR \read(*var_1_1_Pointer) [L54] EXPR \read(*var_1_1_Pointer) [L54] EXPR \read(*var_1_3_Pointer) [L54] COND TRUE ((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR ((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR ((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))) [L55] (*(var_1_5_Pointer)) = ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))) [L59] EXPR \read(*var_1_14_Pointer) [L59] signed long int stepLocal_0 = 5 * (*(var_1_14_Pointer)); [L60] EXPR \read(*var_1_3_Pointer) [L60] EXPR \read(*var_1_1_Pointer) [L60] EXPR (((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))) [L60] EXPR \read(*var_1_1_Pointer) [L60] EXPR (((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))) [L60] EXPR \read(*var_1_1_Pointer) [L60] COND TRUE (((((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))))) == (*(var_1_1_Pointer)) [L61] EXPR \read(*var_1_14_Pointer) [L61] COND FALSE !((*(var_1_14_Pointer)) > stepLocal_0) [L67] EXPR \read(*var_1_1_Pointer) [L67] EXPR \read(*var_1_3_Pointer) [L67] COND FALSE !((*(var_1_1_Pointer)) < (*(var_1_3_Pointer))) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR \read(*var_1_12_Pointer) [L86] EXPR (*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1) [L86] EXPR \read(*var_1_1_Pointer) [L86] EXPR \read(*var_1_3_Pointer) [L86] EXPR (*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1) [L86] EXPR ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer))))) [L86] EXPR (((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))))) && (((((((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))))) == (*(var_1_1_Pointer))) ? (((*(var_1_14_Pointer)) > (5 * (*(var_1_14_Pointer)))) ? (((*(var_1_1_Pointer)) < ((*(var_1_1_Pointer)) * 256.5f)) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))) : 1) : 1) : 1) [L86] EXPR ((((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))))) && (((((((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))))) == (*(var_1_1_Pointer))) ? (((*(var_1_14_Pointer)) > (5 * (*(var_1_14_Pointer)))) ? (((*(var_1_1_Pointer)) < ((*(var_1_1_Pointer)) * 256.5f)) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) : 1) [L86] EXPR (((((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))))) && (((((((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))))) == (*(var_1_1_Pointer))) ? (((*(var_1_14_Pointer)) > (5 * (*(var_1_14_Pointer)))) ? (((*(var_1_1_Pointer)) < ((*(var_1_1_Pointer)) * 256.5f)) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) : 1)) && ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_13_Pointer)))) [L86] EXPR ((((((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))))) && (((((((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))))) == (*(var_1_1_Pointer))) ? (((*(var_1_14_Pointer)) > (5 * (*(var_1_14_Pointer)))) ? (((*(var_1_1_Pointer)) < ((*(var_1_1_Pointer)) * 256.5f)) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) : 1)) && ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_13_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) [L86-L87] return ((((((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_3_Pointer)))) : ((! ((*(var_1_3_Pointer)) < (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((((*(var_1_1_Pointer)) + 8.125) > ((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_14_Pointer)))) ? (((*(var_1_14_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))))) && (((((((*(var_1_3_Pointer))) < ((*(var_1_1_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_1_Pointer))))) == (*(var_1_1_Pointer))) ? (((*(var_1_14_Pointer)) > (5 * (*(var_1_14_Pointer)))) ? (((*(var_1_1_Pointer)) < ((*(var_1_1_Pointer)) * 256.5f)) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) : 1)) && ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_13_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 1, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 04:52:07,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 ae3082e6816ab7154f1817fbd0925b1957ee0101c78958f1f0ff24c3b37d011b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:52:10,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:52:10,180 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:52:10,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:52:10,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:52:10,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:52:10,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:52:10,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:52:10,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:52:10,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:52:10,236 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:52:10,236 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:52:10,236 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:52:10,236 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:52:10,237 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:52:10,237 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:52:10,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:52:10,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:52:10,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:52:10,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:52:10,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:52:10,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:52:10,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:52:10,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:52:10,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:52:10,240 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:52:10,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:52:10,240 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:52:10,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:52:10,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:52:10,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:52:10,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:52:10,242 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:52:10,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:52:10,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:52:10,242 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:52:10,242 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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 -> ae3082e6816ab7154f1817fbd0925b1957ee0101c78958f1f0ff24c3b37d011b [2024-11-14 04:52:10,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:52:10,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:52:10,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:52:10,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:52:10,643 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:52:10,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i Unable to find full path for "g++" [2024-11-14 04:52:12,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:52:12,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:52:12,839 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i [2024-11-14 04:52:12,852 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data/140e482e0/94f51b0318db4a848f09824ccf073e78/FLAG0b707c68b [2024-11-14 04:52:13,141 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/data/140e482e0/94f51b0318db4a848f09824ccf073e78 [2024-11-14 04:52:13,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:52:13,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:52:13,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:52:13,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:52:13,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:52:13,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c416ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13, skipping insertion in model container [2024-11-14 04:52:13,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:52:13,330 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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i[916,929] [2024-11-14 04:52:13,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:52:13,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:52:13,412 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_1b6ac41f-bb95-49e0-a045-fe3252d9988a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-29.i[916,929] [2024-11-14 04:52:13,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:52:13,468 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:52:13,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13 WrapperNode [2024-11-14 04:52:13,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:52:13,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:52:13,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:52:13,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:52:13,477 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:52:13" (1/1) ... [2024-11-14 04:52:13,490 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:52:13" (1/1) ... [2024-11-14 04:52:13,527 INFO L138 Inliner]: procedures = 33, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-11-14 04:52:13,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:52:13,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:52:13,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:52:13,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:52:13,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:52:13,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:52:13,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:52:13,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:52:13,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (1/1) ... [2024-11-14 04:52:13,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:52:13,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:52:13,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:13,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:52:13,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:52:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:52:13,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:52:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 04:52:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 04:52:13,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:52:13,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:52:22,897 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-14 04:52:22,898 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:52:22,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:52:22,909 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:52:22,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:22 BoogieIcfgContainer [2024-11-14 04:52:22,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:52:22,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:52:22,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:52:22,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:52:22,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:52:13" (1/3) ... [2024-11-14 04:52:22,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfddfb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:22, skipping insertion in model container [2024-11-14 04:52:22,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:13" (2/3) ... [2024-11-14 04:52:22,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfddfb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:22, skipping insertion in model container [2024-11-14 04:52:22,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:22" (3/3) ... [2024-11-14 04:52:22,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-29.i [2024-11-14 04:52:22,934 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:52:22,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-29.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:52:22,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:52:23,006 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;@517f9a3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:52:23,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:52:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:52:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:52:23,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:52:23,020 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:52:23,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:52:23,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:52:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1489561218, now seen corresponding path program 1 times [2024-11-14 04:52:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:52:23,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964304140] [2024-11-14 04:52:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:52:23,036 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:52:23,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:52:23,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:23,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:52:23,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:52:23,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:52:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 04:52:23,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:52:23,619 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:52:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964304140] [2024-11-14 04:52:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964304140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:52:23,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:52:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:52:23,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4863448] [2024-11-14 04:52:23,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:52:23,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:52:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:52:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:52:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:52:23,662 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:52:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:52:23,705 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-14 04:52:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:52:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-14 04:52:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:52:23,719 INFO L225 Difference]: With dead ends: 169 [2024-11-14 04:52:23,720 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 04:52:23,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:52:23,732 INFO L432 NwaCegarLoop]: 120 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, 120 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:52:23,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:52:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 04:52:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 04:52:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:52:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-14 04:52:23,772 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-14 04:52:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:52:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-14 04:52:23,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:52:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-14 04:52:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:52:23,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:52:23,776 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:52:23,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:23,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:23,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:52:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:52:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 784635190, now seen corresponding path program 1 times [2024-11-14 04:52:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:52:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489072456] [2024-11-14 04:52:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:52:23,978 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:52:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:52:23,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:23,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:52:24,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:52:24,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:52:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:52:24,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:52:24,728 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:52:24,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489072456] [2024-11-14 04:52:24,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489072456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:52:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:52:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:52:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451813046] [2024-11-14 04:52:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:52:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:52:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:52:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:52:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:52:24,731 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:52:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:52:24,983 INFO L93 Difference]: Finished difference Result 172 states and 247 transitions. [2024-11-14 04:52:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:52:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:52:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:52:24,989 INFO L225 Difference]: With dead ends: 172 [2024-11-14 04:52:24,989 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 04:52:24,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:52:24,992 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:52:24,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:52:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 04:52:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-14 04:52:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:52:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-14 04:52:25,012 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2024-11-14 04:52:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:52:25,014 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-14 04:52:25,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:52:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-14 04:52:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:52:25,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:52:25,022 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:52:25,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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)] Ended with exit code 0 [2024-11-14 04:52:25,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:25,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:52:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:52:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1735324744, now seen corresponding path program 1 times [2024-11-14 04:52:25,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:52:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027734824] [2024-11-14 04:52:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:52:25,225 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:52:25,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:52:25,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:25,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:52:25,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:52:25,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:52:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:52:26,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:52:26,004 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:52:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027734824] [2024-11-14 04:52:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027734824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:52:26,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:52:26,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:52:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671318971] [2024-11-14 04:52:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:52:26,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:52:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:52:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:52:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:52:26,010 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:52:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:52:26,266 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2024-11-14 04:52:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:52:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:52:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:52:26,271 INFO L225 Difference]: With dead ends: 180 [2024-11-14 04:52:26,271 INFO L226 Difference]: Without dead ends: 93 [2024-11-14 04:52:26,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:52:26,277 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:52:26,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:52:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-14 04:52:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-14 04:52:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:52:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-14 04:52:26,297 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2024-11-14 04:52:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:52:26,297 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-14 04:52:26,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:52:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-14 04:52:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:52:26,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:52:26,303 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:52:26,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:26,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:26,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:52:26,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:52:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1733477702, now seen corresponding path program 1 times [2024-11-14 04:52:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:52:26,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424943883] [2024-11-14 04:52:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:52:26,509 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:52:26,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:52:26,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:26,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:52:27,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:52:27,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:52:27,258 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 04:52:27,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 43 [2024-11-14 04:52:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:52:27,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:52:27,396 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:52:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424943883] [2024-11-14 04:52:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424943883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:52:27,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:52:27,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:52:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348586094] [2024-11-14 04:52:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:52:27,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:52:27,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:52:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:52:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:52:27,398 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:52:29,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s 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:52:31,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:52:33,441 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:52:36,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s 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:52:38,236 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 [0] [2024-11-14 04:52:39,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s 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:52:41,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s 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:52:43,591 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 [0] [2024-11-14 04:52:45,595 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:52:47,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s 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:52:49,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s 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:52:51,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s 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:52:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:52:51,832 INFO L93 Difference]: Finished difference Result 233 states and 324 transitions. [2024-11-14 04:52:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:52:51,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:52:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:52:51,835 INFO L225 Difference]: With dead ends: 233 [2024-11-14 04:52:51,835 INFO L226 Difference]: Without dead ends: 144 [2024-11-14 04:52:51,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:52:51,838 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:52:51,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 308 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 8 Unknown, 0 Unchecked, 24.3s Time] [2024-11-14 04:52:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-14 04:52:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2024-11-14 04:52:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:52:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-11-14 04:52:51,854 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 73 [2024-11-14 04:52:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:52:51,855 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-11-14 04:52:51,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:52:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-11-14 04:52:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:52:51,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:52:51,858 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:52:51,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:52:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:52,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:52:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:52:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash 973141692, now seen corresponding path program 1 times [2024-11-14 04:52:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:52:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264554841] [2024-11-14 04:52:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:52:52,062 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:52:52,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:52:52,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:52,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:52:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:52:52,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:52:52,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:52:53,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:52:55,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:52:56,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:52:57,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:52:58,924 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-14 04:52:58,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 64 [2024-11-14 04:52:58,995 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-14 04:52:58,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 76 [2024-11-14 04:52:59,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:52:59,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 71 [2024-11-14 04:52:59,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 86 [2024-11-14 04:52:59,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 63 [2024-11-14 04:52:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:52:59,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:53:00,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse1 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_33|)) c_~var_1_5_Pointer~0.base v_ArrVal_98))) (fp.lt (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (not (= (let ((.cse3 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_33|)))))) is different from false [2024-11-14 04:53:00,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_12_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 32)) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.base (_ BitVec 32)) (v_ArrVal_93 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) c_~var_1_14_Pointer~0.base v_ArrVal_93))) (or (not (let ((.cse1 (store (store .cse3 c_~var_1_1_Pointer~0.base (store (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_33|)) c_~var_1_5_Pointer~0.base v_ArrVal_98))) (fp.lt (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_33|)) (let ((.cse4 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))))) is different from false [2024-11-14 04:53:00,665 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:53:00,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264554841] [2024-11-14 04:53:00,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264554841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:53:00,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1109360947] [2024-11-14 04:53:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:53:00,666 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:53:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:53:00,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:53:00,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-14 04:53:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:53:02,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 04:53:02,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:53:03,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:53:05,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:53:06,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:53:08,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:53:09,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-14 04:53:09,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 04:53:10,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 126 [2024-11-14 04:53:28,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= .cse0 .cse1) (fp.leq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0)))) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))))) is different from false [2024-11-14 04:53:30,795 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= .cse0 .cse1) (fp.leq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0)))) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))))) is different from true [2024-11-14 04:54:02,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= .cse0 .cse1) (fp.leq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0)))) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse1) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse0) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))))) is different from false [2024-11-14 04:54:04,932 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= .cse0 .cse1) (fp.leq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0)))) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse1) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse0) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))))) is different from true [2024-11-14 04:54:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:54:05,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:54:15,063 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem14#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem15#1| |c_ULTIMATE.start_step_#t~mem16#1|)))) is different from false [2024-11-14 04:54:17,090 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem14#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem15#1| |c_ULTIMATE.start_step_#t~mem16#1|)))) is different from true [2024-11-14 04:54:27,004 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))))) (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse4 (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse3 (select (select .cse4 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (select (select .cse4 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from false [2024-11-14 04:54:29,034 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))))) (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse4 (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse3 (select (select .cse4 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (select (select .cse4 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from true [2024-11-14 04:54:41,906 WARN L873 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_39|)))) (or (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1))) (not (= .cse1 .cse0)) (not (let ((.cse3 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_39|)) c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse2 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (select (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))))) is different from true [2024-11-14 04:54:54,406 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_120 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_119 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_119) c_~var_1_14_Pointer~0.base v_ArrVal_120))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_39|))) (.cse0 (let ((.cse6 (select (select .cse5 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (= .cse0 .cse1)) (not (let ((.cse3 (store (store .cse5 c_~var_1_1_Pointer~0.base (store (select .cse5 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_39|)) c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse2 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (select (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))) (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0))))))) is different from false [2024-11-14 04:54:56,425 WARN L873 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_120 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_119 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_119) c_~var_1_14_Pointer~0.base v_ArrVal_120))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_39|))) (.cse0 (let ((.cse6 (select (select .cse5 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (= .cse0 .cse1)) (not (let ((.cse3 (store (store .cse5 c_~var_1_1_Pointer~0.base (store (select .cse5 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_39|)) c_~var_1_5_Pointer~0.base v_ArrVal_123))) (fp.lt (let ((.cse2 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (select (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))) (fp.gt (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 8.0))) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0))))))) is different from true [2024-11-14 04:55:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1109360947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:55:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004489394] [2024-11-14 04:55:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:55:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:55:16,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:55:16,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:55:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:21,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:55:21,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:55:22,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2024-11-14 04:55:22,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2024-11-14 04:55:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-14 04:55:23,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:55:25,189 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-14 04:55:25,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 91 [2024-11-14 04:55:25,261 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-14 04:55:25,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 135 [2024-11-14 04:55:25,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:55:25,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 103 [2024-11-14 04:55:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-14 04:55:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004489394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:55:26,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2024-11-14 04:55:26,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 8, 14] total 46 [2024-11-14 04:55:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718513752] [2024-11-14 04:55:26,435 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2024-11-14 04:55:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-14 04:55:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:55:26,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-14 04:55:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1687, Unknown=16, NotChecked=744, Total=2756 [2024-11-14 04:55:26,440 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 46 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 46 states have internal predecessors, (159), 12 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-14 04:55:35,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:55:37,980 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 [0] [2024-11-14 04:55:39,984 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 [0] [2024-11-14 04:55:41,987 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 [0] [2024-11-14 04:55:43,990 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 [0] [2024-11-14 04:55:45,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:55:47,927 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 [0] [2024-11-14 04:55:49,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:55:51,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:55:53,961 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 [0] [2024-11-14 04:55:55,963 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 [0] [2024-11-14 04:55:57,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:55:59,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:01,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:02,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:03,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:56:05,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:07,335 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse3 (let ((.cse11 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse9 c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse4 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (.cse2 (let ((.cse8 (select .cse9 (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= (_ bv11 32) c_~var_1_12_Pointer~0.base) (fp.geq .cse0 .cse1) (= .cse2 .cse3) (fp.leq .cse2 .cse4) (= (_ bv10 32) |c_~#var_1_11~0.base|) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (fp.leq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= (_ bv13 32) c_~var_1_14_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2)))) (= .cse0 .cse3) (= c_~var_1_5_Pointer~0.base (_ bv7 32)) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (fp.leq .cse0 .cse4) (= (_ bv12 32) |c_~#var_1_13~0.base|) (forall ((v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse6 (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_98))) (fp.lt (let ((.cse5 (select (select .cse6 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select (select .cse6 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))) (fp.geq .cse2 .cse1) (= (_ bv0 32) |c_~#var_1_3~0.offset|) (= (_ bv5 32) |c_~#var_1_3~0.base|) (exists ((~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (= (select (select |c_#memory_int| (_ bv11 32)) ~var_1_12_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_7)))) (= (_ bv6 32) |c_~#var_1_4~0.base|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:56:09,359 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse3 (let ((.cse11 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse9 c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse4 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (.cse2 (let ((.cse8 (select .cse9 (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse1 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= (_ bv11 32) c_~var_1_12_Pointer~0.base) (fp.geq .cse0 .cse1) (= .cse2 .cse3) (fp.leq .cse2 .cse4) (= (_ bv10 32) |c_~#var_1_11~0.base|) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (fp.leq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= (_ bv13 32) c_~var_1_14_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2)))) (= .cse0 .cse3) (= c_~var_1_5_Pointer~0.base (_ bv7 32)) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (fp.leq .cse0 .cse4) (= (_ bv12 32) |c_~#var_1_13~0.base|) (forall ((v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse6 (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_98))) (fp.lt (let ((.cse5 (select (select .cse6 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select (select .cse6 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))) (fp.geq .cse2 .cse1) (= (_ bv0 32) |c_~#var_1_3~0.offset|) (= (_ bv5 32) |c_~#var_1_3~0.base|) (exists ((~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (= (select (select |c_#memory_int| (_ bv11 32)) ~var_1_12_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_7)))) (= (_ bv6 32) |c_~#var_1_4~0.base|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:56:11,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:14,161 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 [0] [2024-11-14 04:56:17,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 [0] [2024-11-14 04:56:19,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:21,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse3 (let ((.cse10 (select .cse8 c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse7 (select .cse8 (_ bv0 32)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse6 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= .cse0 .cse1) (fp.leq .cse0 .cse2) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0)))) (= .cse3 .cse1) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse3) (exists ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse4 .cse5) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse5) (= .cse4 |c_ULTIMATE.start_step_#t~mem27#1|) (fp.leq .cse5 .cse2) (fp.geq .cse5 .cse6)))) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse1) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse0) (fp.geq .cse0 .cse6)))) is different from false [2024-11-14 04:56:23,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse3 (let ((.cse10 (select .cse8 c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse7 (select .cse8 (_ bv0 32)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse6 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)))) (and (= (_ bv0 32) c_~var_1_3_Pointer~0.offset) (= .cse0 .cse1) (fp.leq .cse0 .cse2) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0)))) (= .cse3 .cse1) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse3) (exists ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse4 .cse5) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse5) (= .cse4 |c_ULTIMATE.start_step_#t~mem27#1|) (fp.leq .cse5 .cse2) (fp.geq .cse5 .cse6)))) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse1) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse0) (fp.geq .cse0 .cse6)))) is different from true [2024-11-14 04:56:25,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:26,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:28,927 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 [0] [2024-11-14 04:56:30,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:31,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:33,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:56:35,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:37,513 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 [0] [2024-11-14 04:56:38,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:56:46,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:56:47,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s 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:56:49,919 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:56:52,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:56:54,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s 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:56:58,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:00,104 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 [0] [2024-11-14 04:57:02,107 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 [0] [2024-11-14 04:57:04,109 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 [0] [2024-11-14 04:57:05,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:08,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:09,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:11,204 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 [0] [2024-11-14 04:57:14,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:57:16,170 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:57:18,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:57:20,176 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:57:22,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s 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:57:24,519 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:57:26,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s 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:57:28,608 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:57:30,613 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:57:32,616 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:57:34,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:36,876 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 [0] [2024-11-14 04:57:38,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:40,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:42,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:44,984 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 [0] [2024-11-14 04:57:46,987 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 [0] [2024-11-14 04:57:48,990 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 [0] [2024-11-14 04:57:50,993 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 [0] [2024-11-14 04:57:52,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:57:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:58:00,692 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:58:02,695 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:58:04,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s 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:58:07,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:58:09,341 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:58:10,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s 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:58:14,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:58:16,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:58:20,578 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:58:22,580 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:58:23,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s 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:58:26,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:58:28,075 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:58:30,079 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 [0] [2024-11-14 04:58:31,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s 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:58:33,870 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:58:35,873 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:58:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s 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:58:41,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s 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:58:43,088 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:58:44,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s 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:58:46,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:58:48,744 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:58:50,746 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:58:53,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:58:55,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:58:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:58:55,323 INFO L93 Difference]: Finished difference Result 513 states and 716 transitions. [2024-11-14 04:58:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 04:58:55,325 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 46 states have internal predecessors, (159), 12 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) Word has length 73 [2024-11-14 04:58:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:58:55,329 INFO L225 Difference]: With dead ends: 513 [2024-11-14 04:58:55,329 INFO L226 Difference]: Without dead ends: 418 [2024-11-14 04:58:55,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=722, Invalid=3458, Unknown=20, NotChecked=1350, Total=5550 [2024-11-14 04:58:55,334 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1519 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 138 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 192.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 2296 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 1103 IncrementalHoareTripleChecker+Unchecked, 194.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:58:55,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 2296 Invalid, 3894 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [138 Valid, 2592 Invalid, 61 Unknown, 1103 Unchecked, 194.4s Time] [2024-11-14 04:58:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-14 04:58:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 240. [2024-11-14 04:58:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 218 states have (on average 1.385321100917431) internal successors, (302), 218 states have internal predecessors, (302), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:58:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 338 transitions. [2024-11-14 04:58:55,395 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 338 transitions. Word has length 73 [2024-11-14 04:58:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:58:55,396 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 338 transitions. [2024-11-14 04:58:55,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 46 states have internal predecessors, (159), 12 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-14 04:58:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 338 transitions. [2024-11-14 04:58:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:58:55,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:58:55,402 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:58:55,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:58:55,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-14 04:58:55,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:58:56,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:58:56,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:58:56,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:58:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1310775876, now seen corresponding path program 1 times [2024-11-14 04:58:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:58:56,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018456530] [2024-11-14 04:58:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:58:56,008 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:58:56,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:58:56,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:58:56,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:58:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:58:56,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:58:56,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:58:56,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 26 [2024-11-14 04:58:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 04:58:56,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:58:56,688 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:58:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018456530] [2024-11-14 04:58:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018456530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:58:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:58:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:58:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213161317] [2024-11-14 04:58:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:58:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:58:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:58:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:58:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:58:56,690 INFO L87 Difference]: Start difference. First operand 240 states and 338 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:58:58,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:59:00,980 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:59:03,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:59:05,803 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:59:08,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:59:10,751 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:59:12,756 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:59:14,763 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 [0] [2024-11-14 04:59:16,887 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:59:19,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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:59:21,846 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:59:22,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s 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:59:25,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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:59:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:59:25,491 INFO L93 Difference]: Finished difference Result 577 states and 808 transitions. [2024-11-14 04:59:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:59:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 04:59:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:59:25,494 INFO L225 Difference]: With dead ends: 577 [2024-11-14 04:59:25,494 INFO L226 Difference]: Without dead ends: 340 [2024-11-14 04:59:25,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:59:25,496 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:59:25,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 314 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 13 Unknown, 0 Unchecked, 28.7s Time] [2024-11-14 04:59:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-14 04:59:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 242. [2024-11-14 04:59:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 220 states have (on average 1.3818181818181818) internal successors, (304), 220 states have internal predecessors, (304), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:59:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2024-11-14 04:59:25,525 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 73 [2024-11-14 04:59:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:59:25,525 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2024-11-14 04:59:25,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 04:59:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2024-11-14 04:59:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:59:25,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:59:25,528 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:59:25,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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)] Ended with exit code 0 [2024-11-14 04:59:25,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:59:25,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:59:25,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:59:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1395843518, now seen corresponding path program 1 times [2024-11-14 04:59:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:59:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971415283] [2024-11-14 04:59:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:25,729 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:59:25,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:59:25,731 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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:59:25,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (10)] Waiting until timeout for monitored process [2024-11-14 04:59:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:26,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:59:26,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:59:26,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:59:28,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:59:29,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:59:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:59:31,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2024-11-14 04:59:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:59:31,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 04:59:31,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 74 [2024-11-14 04:59:32,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 58 [2024-11-14 04:59:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:59:32,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:59:33,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_53| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (or (let ((.cse0 (let ((.cse1 (select (select (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_53|)) c_~var_1_5_Pointer~0.base v_ArrVal_185) c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.eq .cse0 .cse0)) (not (= (let ((.cse2 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_53|)))))) is different from false [2024-11-14 04:59:33,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (_ BitVec 32)) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_53| (_ BitVec 32)) (v_ArrVal_181 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset v_ArrVal_182)) c_~var_1_14_Pointer~0.base v_ArrVal_181))) (or (not (= (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_53|)))) (let ((.cse2 (let ((.cse3 (select (select (store (store .cse1 c_~var_1_1_Pointer~0.base (store (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_53|)) c_~var_1_5_Pointer~0.base v_ArrVal_185) c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.eq .cse2 .cse2))))) is different from false [2024-11-14 04:59:33,345 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:59:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971415283] [2024-11-14 04:59:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971415283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:59:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777668372] [2024-11-14 04:59:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:59:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:59:33,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:59:33,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-14 04:59:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:35,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 04:59:35,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:59:36,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:59:37,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:59:38,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:59:39,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:59:40,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2024-11-14 04:59:41,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2024-11-14 04:59:41,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2024-11-14 04:59:41,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 46 [2024-11-14 04:59:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:59:42,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:59:42,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_59| (_ BitVec 32))) (or (not (= (let ((.cse0 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_59|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_59|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_59|)))) (let ((.cse1 (let ((.cse2 (select (select (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_59|)) c_~var_1_5_Pointer~0.base v_ArrVal_185) c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.eq .cse1 .cse1)))) is different from false [2024-11-14 04:59:42,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_208 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_59| (_ BitVec 32)) (v_ArrVal_207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_207) c_~var_1_14_Pointer~0.base v_ArrVal_208))) (or (not (= (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_59|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_59|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_59|)))) (let ((.cse2 (let ((.cse3 (select (select (store (store .cse1 c_~var_1_1_Pointer~0.base (store (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_59|)) c_~var_1_5_Pointer~0.base v_ArrVal_185) c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.eq .cse2 .cse2))))) is different from false [2024-11-14 04:59:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [777668372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:59:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578841254] [2024-11-14 04:59:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:42,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:59:42,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:59:42,621 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:59:42,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 04:59:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:46,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 04:59:46,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:59:46,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:59:49,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:59:50,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:59:51,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:59:52,585 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-14 04:59:52,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2024-11-14 04:59:52,669 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-14 04:59:52,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 58 [2024-11-14 04:59:53,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 59 [2024-11-14 04:59:53,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2024-11-14 04:59:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:59:55,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:59:55,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (select (select (store |c_#memory_int| c_~var_1_5_Pointer~0.base v_ArrVal_236) c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.eq .cse0 .cse0))) is different from false [2024-11-14 04:59:55,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_65| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (or (not (= (let ((.cse0 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_65|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_65|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_65|)))) (let ((.cse1 (let ((.cse2 (select (select (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_65|)) c_~var_1_5_Pointer~0.base v_ArrVal_236) c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.eq .cse1 .cse1)))) is different from false [2024-11-14 04:59:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578841254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:59:59,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:59:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2024-11-14 04:59:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536375090] [2024-11-14 04:59:59,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:59:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 04:59:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:59:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 04:59:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1678, Unknown=41, NotChecked=534, Total=2450 [2024-11-14 04:59:59,813 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand has 39 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 38 states have internal predecessors, (129), 12 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-14 05:00:07,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:09,777 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 [0] [2024-11-14 05:00:13,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:16,029 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 [0] [2024-11-14 05:00:18,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:20,109 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 [0] [2024-11-14 05:00:22,112 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 [0] [2024-11-14 05:00:26,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:27,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:30,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:32,390 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 [0] [2024-11-14 05:00:34,394 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 [0] [2024-11-14 05:00:36,398 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 [0] [2024-11-14 05:00:38,401 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 [0] [2024-11-14 05:00:40,405 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 [0] [2024-11-14 05:00:42,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:51,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:00:52,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:00:55,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:00:57,800 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 [0] [2024-11-14 05:00:59,802 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 05:01:01,805 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 [0] [2024-11-14 05:01:03,807 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 05:01:05,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:08,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:10,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 [0] [2024-11-14 05:01:12,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:15,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:17,176 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 [0] [2024-11-14 05:01:18,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:21,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:26,690 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 [0] [2024-11-14 05:01:34,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:01:36,388 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 05:01:37,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:39,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:01:41,900 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 05:01:43,904 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 [0] [2024-11-14 05:01:45,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:01:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:46,608 INFO L93 Difference]: Finished difference Result 742 states and 1043 transitions. [2024-11-14 05:01:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:01:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 38 states have internal predecessors, (129), 12 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) Word has length 73 [2024-11-14 05:01:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:46,614 INFO L225 Difference]: With dead ends: 742 [2024-11-14 05:01:46,614 INFO L226 Difference]: Without dead ends: 503 [2024-11-14 05:01:46,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=396, Invalid=2343, Unknown=41, NotChecked=642, Total=3422 [2024-11-14 05:01:46,618 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1248 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 111 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:46,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1148 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1510 Invalid, 32 Unknown, 0 Unchecked, 102.8s Time] [2024-11-14 05:01:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-14 05:01:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 275. [2024-11-14 05:01:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 246 states have (on average 1.3699186991869918) internal successors, (337), 246 states have internal predecessors, (337), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:01:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 385 transitions. [2024-11-14 05:01:46,684 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 385 transitions. Word has length 73 [2024-11-14 05:01:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:46,685 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 385 transitions. [2024-11-14 05:01:46,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 38 states have internal predecessors, (129), 12 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-14 05:01:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 385 transitions. [2024-11-14 05:01:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 05:01:46,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:46,687 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:46,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-14 05:01:46,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (10)] Ended with exit code 0 [2024-11-14 05:01:47,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:01:47,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:47,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:47,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1945183620, now seen corresponding path program 1 times [2024-11-14 05:01:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256277812] [2024-11-14 05:01:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:47,289 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 05:01:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:47,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 05:01:47,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (13)] Waiting until timeout for monitored process [2024-11-14 05:01:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:47,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:47,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 05:01:47,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:47,739 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256277812] [2024-11-14 05:01:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256277812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248340495] [2024-11-14 05:01:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:47,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:47,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:47,741 INFO L87 Difference]: Start difference. First operand 275 states and 385 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 05:01:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:47,850 INFO L93 Difference]: Finished difference Result 547 states and 767 transitions. [2024-11-14 05:01:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:01:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-14 05:01:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:47,854 INFO L225 Difference]: With dead ends: 547 [2024-11-14 05:01:47,855 INFO L226 Difference]: Without dead ends: 275 [2024-11-14 05:01:47,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:47,857 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:47,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-14 05:01:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-14 05:01:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 246 states have (on average 1.3617886178861789) internal successors, (335), 246 states have internal predecessors, (335), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:01:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 383 transitions. [2024-11-14 05:01:47,890 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 383 transitions. Word has length 73 [2024-11-14 05:01:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:47,890 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 383 transitions. [2024-11-14 05:01:47,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 05:01:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 383 transitions. [2024-11-14 05:01:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 05:01:47,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:47,893 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:47,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (13)] Ended with exit code 0 [2024-11-14 05:01:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 05:01:48,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1985619188, now seen corresponding path program 1 times [2024-11-14 05:01:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085518181] [2024-11-14 05:01:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:48,095 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 05:01:48,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:48,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 05:01:48,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (14)] Waiting until timeout for monitored process [2024-11-14 05:01:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:48,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 05:01:48,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:49,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:01:51,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:01:52,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:01:53,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:01:54,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2024-11-14 05:01:54,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:01:54,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 05:01:54,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 74 [2024-11-14 05:01:55,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 58 [2024-11-14 05:01:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:01:55,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:01:56,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (or (not (= (let ((.cse0 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_75|)))) (not (let ((.cse2 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_75|)) c_~var_1_5_Pointer~0.base v_ArrVal_279))) (fp.lt (let ((.cse1 (select (select .cse2 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (select (select .cse2 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))))) is different from false [2024-11-14 05:01:56,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_277 (_ BitVec 32))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset v_ArrVal_277)) c_~var_1_14_Pointer~0.base v_ArrVal_276))) (or (not (let ((.cse1 (store (store .cse3 c_~var_1_1_Pointer~0.base (store (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_75|)) c_~var_1_5_Pointer~0.base v_ArrVal_279))) (fp.lt (let ((.cse0 (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (not (= (let ((.cse4 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_75|))))))) is different from false [2024-11-14 05:01:56,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085518181] [2024-11-14 05:01:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085518181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1549865390] [2024-11-14 05:01:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:56,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:01:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:01:56,983 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:01:56,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-14 05:01:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:59,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:01:59,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:01,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2024-11-14 05:02:01,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 90 [2024-11-14 05:02:22,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from false [2024-11-14 05:02:24,772 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from true [2024-11-14 05:02:47,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from false [2024-11-14 05:02:49,071 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from true [2024-11-14 05:03:13,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= |c_ULTIMATE.start_step_#t~ite30#1| .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from false [2024-11-14 05:03:15,105 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= |c_ULTIMATE.start_step_#t~ite30#1| .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from true [2024-11-14 05:03:55,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_34| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_34|)) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from false [2024-11-14 05:04:34,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse1 (let ((.cse2 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_34| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_34|)) (= |c_ULTIMATE.start_step_#t~mem36#1| .cse0) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= |c_ULTIMATE.start_step_#t~mem37#1| .cse1) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from false [2024-11-14 05:04:36,732 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse1 (let ((.cse2 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (exists ((|v_ULTIMATE.start_step_#t~mem31#1_34| (_ FloatingPoint 8 24))) (fp.eq .cse0 |v_ULTIMATE.start_step_#t~mem31#1_34|)) (= |c_ULTIMATE.start_step_#t~mem36#1| .cse0) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= |c_ULTIMATE.start_step_#t~mem37#1| .cse1) (= c_~var_1_10_Pointer~0.base (_ bv9 32)))) is different from true [2024-11-14 05:04:36,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 132 [2024-11-14 05:04:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 05:04:36,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:04:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1549865390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:04:36,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2024-11-14 05:04:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394820185] [2024-11-14 05:04:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:36,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:04:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:04:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:04:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=389, Unknown=14, NotChecked=322, Total=812 [2024-11-14 05:04:36,859 INFO L87 Difference]: Start difference. First operand 275 states and 383 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 05:04:39,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:40,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:44,993 WARN L286 SmtUtils]: Spent 19.75s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:05:46,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:49,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (= c_~var_1_5_Pointer~0.base (_ bv7 32)) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-14 05:05:51,373 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= |c_ULTIMATE.start_step_#t~mem26#1| .cse1) (= c_~var_1_5_Pointer~0.base (_ bv7 32)) (= |c_ULTIMATE.start_step_#t~mem27#1| .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base) (= c_~var_1_10_Pointer~0.base (_ bv9 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-14 05:05:53,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:55,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:58,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:00,820 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 05:06:02,822 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 05:06:04,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:06,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:08,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:11,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:12,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:15,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:17,178 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 05:06:19,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:20,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:24,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:06:26,645 INFO L93 Difference]: Finished difference Result 757 states and 1053 transitions. [2024-11-14 05:06:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:06:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2024-11-14 05:06:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:06:26,651 INFO L225 Difference]: With dead ends: 757 [2024-11-14 05:06:26,652 INFO L226 Difference]: Without dead ends: 485 [2024-11-14 05:06:26,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 91.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=32, NotChecked=392, Total=930 [2024-11-14 05:06:26,656 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 158 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1549 IncrementalHoareTripleChecker+Unchecked, 41.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:06:26,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 452 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 13 Unknown, 1549 Unchecked, 41.6s Time] [2024-11-14 05:06:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-14 05:06:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 425. [2024-11-14 05:06:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 382 states have (on average 1.3638743455497382) internal successors, (521), 382 states have internal predecessors, (521), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 05:06:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 593 transitions. [2024-11-14 05:06:26,707 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 593 transitions. Word has length 74 [2024-11-14 05:06:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:06:26,708 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 593 transitions. [2024-11-14 05:06:26,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-14 05:06:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 593 transitions. [2024-11-14 05:06:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 05:06:26,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:06:26,710 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:06:26,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-14 05:06:26,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (14)] Ended with exit code 0 [2024-11-14 05:06:27,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 05:06:27,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:06:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:06:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash 397271286, now seen corresponding path program 1 times [2024-11-14 05:06:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:06:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368840209] [2024-11-14 05:06:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:06:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:06:27,114 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 05:06:27,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/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 (16)] Waiting until timeout for monitored process [2024-11-14 05:06:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:27,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:06:27,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:28,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:06:29,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:06:30,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:06:31,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:06:32,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2024-11-14 05:06:32,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 05:06:32,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 05:06:33,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 74 [2024-11-14 05:06:34,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 80 [2024-11-14 05:06:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:06:34,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:06:37,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_86| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite30#1| (_ FloatingPoint 8 24)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_86|)) c_~var_1_5_Pointer~0.base v_ArrVal_327))) (let ((.cse0 (let ((.cse5 (select (select .cse4 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (.cse1 (let ((.cse3 (select (select .cse4 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (not (fp.eq |ULTIMATE.start_step_#t~ite30#1| .cse0)) (fp.lt .cse1 .cse0) (not (= (let ((.cse2 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_86|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_86|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_86|)))) (fp.lt .cse0 .cse1) (fp.eq .cse0 .cse1))))) is different from false [2024-11-14 05:06:38,292 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_325 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_86| (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite30#1| (_ FloatingPoint 8 24)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset v_ArrVal_325)) c_~var_1_14_Pointer~0.base v_ArrVal_323))) (let ((.cse5 (store (store .cse3 c_~var_1_1_Pointer~0.base (store (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset |v_skolemized_q#valueAsBitvector_86|)) c_~var_1_5_Pointer~0.base v_ArrVal_327))) (let ((.cse0 (let ((.cse6 (select (select .cse5 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (let ((.cse4 (select (select .cse5 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.eq |ULTIMATE.start_step_#t~ite30#1| .cse0)) (fp.lt .cse0 .cse1) (not (= (let ((.cse2 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_86|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_86|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_86|)))) (fp.lt .cse1 .cse0) (fp.eq .cse0 .cse1)))))) is different from false [2024-11-14 05:06:38,896 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:06:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368840209] [2024-11-14 05:06:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368840209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1219225940] [2024-11-14 05:06:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:38,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:06:38,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:06:38,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:06:38,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b6ac41f-bb95-49e0-a045-fe3252d9988a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-14 05:06:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:40,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 05:06:40,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:42,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2024-11-14 05:06:42,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 90 [2024-11-14 05:06:57,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| (_ bv5 32)) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (.cse0 (let ((.cse2 (select (select |c_#memory_int| (_ bv4 32)) c_~var_1_1_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (and (not (fp.gt (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 8.0))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= .cse1 .cse0) (= (_ bv5 32) c_~var_1_3_Pointer~0.base))) is different from false