./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.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_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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_88546b6a-7664-4be3-9c1d-054d34583c81/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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:20:12,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:20:12,624 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:20:12,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:20:12,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:20:12,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:20:12,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:20:12,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:20:12,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:20:12,666 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:20:12,666 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:20:12,667 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:20:12,667 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:20:12,667 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:20:12,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:20:12,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:20:12,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:20:12,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:20:12,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:20:12,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:20:12,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:20:12,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:12,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:20:12,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:20:12,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:20:12,673 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:20:12,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:20:12,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:20:12,673 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:20:12,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:20:12,674 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_88546b6a-7664-4be3-9c1d-054d34583c81/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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2024-11-14 03:20:12,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:20:12,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:20:12,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:20:12,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:20:12,984 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:20:12,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i Unable to find full path for "g++" [2024-11-14 03:20:15,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:20:15,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:20:15,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2024-11-14 03:20:15,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data/f8c446b0a/0cf5458be5ac4598a9f8d5bd78e0bced/FLAG7d9a7ea6f [2024-11-14 03:20:15,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data/f8c446b0a/0cf5458be5ac4598a9f8d5bd78e0bced [2024-11-14 03:20:15,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:20:15,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:20:15,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:15,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:20:15,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:20:15,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752b87bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15, skipping insertion in model container [2024-11-14 03:20:15,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:20:15,511 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_88546b6a-7664-4be3-9c1d-054d34583c81/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2024-11-14 03:20:15,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:15,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:20:15,593 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_88546b6a-7664-4be3-9c1d-054d34583c81/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2024-11-14 03:20:15,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:15,657 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:20:15,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15 WrapperNode [2024-11-14 03:20:15,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:15,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:15,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:20:15,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:20:15,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,716 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 414 [2024-11-14 03:20:15,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:15,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:20:15,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:20:15,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:20:15,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:20:15,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:20:15,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:20:15,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:20:15,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (1/1) ... [2024-11-14 03:20:15,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:15,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:20:15,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:20:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:20:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 03:20:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:20:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 03:20:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:20:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 03:20:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:20:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:20:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:20:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:20:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:20:16,029 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:20:16,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:20:16,592 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-14 03:20:16,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:20:17,254 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:20:17,255 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:20:17,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:17 BoogieIcfgContainer [2024-11-14 03:20:17,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:20:17,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:20:17,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:20:17,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:20:17,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:20:15" (1/3) ... [2024-11-14 03:20:17,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6410c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:20:17, skipping insertion in model container [2024-11-14 03:20:17,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:15" (2/3) ... [2024-11-14 03:20:17,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6410c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:20:17, skipping insertion in model container [2024-11-14 03:20:17,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:17" (3/3) ... [2024-11-14 03:20:17,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2024-11-14 03:20:17,284 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:20:17,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-31.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:20:17,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:20:17,368 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;@1b9d942d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:20:17,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:20:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:20:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 03:20:17,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:17,382 INFO L215 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:17,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:17,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1322746818, now seen corresponding path program 1 times [2024-11-14 03:20:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:20:17,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713110898] [2024-11-14 03:20:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:20:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 03:20:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62589002] [2024-11-14 03:20:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:18,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:18,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:20:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:20:19,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:20:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:20:19,353 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:20:19,356 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:20:19,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:20:19,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:20:19,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 03:20:19,569 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 03:20:19,680 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:20:19,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:20:19 BoogieIcfgContainer [2024-11-14 03:20:19,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:20:19,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:20:19,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:20:19,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:20:19,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:17" (3/4) ... [2024-11-14 03:20:19,693 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:20:19,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:20:19,697 INFO L158 Benchmark]: Toolchain (without parser) took 4391.89ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 50.7MB in the end (delta: 65.5MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2024-11-14 03:20:19,697 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:19,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.25ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 101.7MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:20:19,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.64ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 98.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:19,702 INFO L158 Benchmark]: Boogie Preprocessor took 67.16ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:19,703 INFO L158 Benchmark]: RCFGBuilder took 1468.16ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 73.7MB in the end (delta: 22.1MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-11-14 03:20:19,703 INFO L158 Benchmark]: TraceAbstraction took 2429.23ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 51.8MB in the end (delta: 21.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-11-14 03:20:19,703 INFO L158 Benchmark]: Witness Printer took 5.63ms. Allocated memory is still 142.6MB. Free memory was 51.8MB in the beginning and 50.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:19,705 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.99ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.25ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 101.7MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.64ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 98.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.16ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1468.16ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 73.7MB in the end (delta: 22.1MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2429.23ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 51.8MB in the end (delta: 21.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 5.63ms. Allocated memory is still 142.6MB. Free memory was 51.8MB in the beginning and 50.7MB in the end (delta: 1.2MB). 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 someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_Array_0[0][0] [L39] COND FALSE !(! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L48] EXPR unsigned_char_Array_0[1] [L48] EXPR unsigned_char_Array_0[1] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] EXPR unsigned_char_Array_0[1] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_unsigned_char_Array_0[1] [L66] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L69] EXPR BOOL_unsigned_char_Array_0[0] [L69] BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1]) [L69] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR BOOL_unsigned_char_Array_0[0] [L98] EXPR BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1]) [L98] EXPR (BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1 [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_Array_0[0][0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 1, TraceHistogramMax: 11, 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=31occurred 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.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 2 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 03:20:19,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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_88546b6a-7664-4be3-9c1d-054d34583c81/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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:20:22,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:20:22,535 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:20:22,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:20:22,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:20:22,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:20:22,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:20:22,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:20:22,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:20:22,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:20:22,633 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:20:22,633 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:20:22,633 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:20:22,633 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:20:22,633 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:20:22,633 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:20:22,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:20:22,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:20:22,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:20:22,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:22,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:20:22,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:20:22,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:20:22,636 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:20:22,636 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:22,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:20:22,636 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:20:22,636 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_88546b6a-7664-4be3-9c1d-054d34583c81/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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2024-11-14 03:20:22,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:20:22,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:20:22,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:20:22,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:20:22,981 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:20:22,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i Unable to find full path for "g++" [2024-11-14 03:20:24,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:20:25,345 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:20:25,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2024-11-14 03:20:25,367 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data/e8d079d17/7935bebec12a47149a7937c4dbdc4e13/FLAG142b79064 [2024-11-14 03:20:25,394 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/data/e8d079d17/7935bebec12a47149a7937c4dbdc4e13 [2024-11-14 03:20:25,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:20:25,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:20:25,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:25,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:20:25,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:20:25,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706c0185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25, skipping insertion in model container [2024-11-14 03:20:25,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:20:25,632 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_88546b6a-7664-4be3-9c1d-054d34583c81/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2024-11-14 03:20:25,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:25,719 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:20:25,732 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_88546b6a-7664-4be3-9c1d-054d34583c81/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2024-11-14 03:20:25,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:25,808 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:20:25,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25 WrapperNode [2024-11-14 03:20:25,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:25,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:25,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:20:25,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:20:25,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,898 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-11-14 03:20:25,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:25,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:20:25,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:20:25,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:20:25,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:20:25,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:20:25,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:20:25,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:20:25,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (1/1) ... [2024-11-14 03:20:25,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:26,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:20:26,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:20:26,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:20:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:20:26,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:20:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:20:26,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:20:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 03:20:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:20:26,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:20:26,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:20:27,004 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-14 03:20:27,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:20:27,022 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:20:27,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:20:27,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:27 BoogieIcfgContainer [2024-11-14 03:20:27,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:20:27,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:20:27,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:20:27,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:20:27,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:20:25" (1/3) ... [2024-11-14 03:20:27,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d37c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:20:27, skipping insertion in model container [2024-11-14 03:20:27,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:25" (2/3) ... [2024-11-14 03:20:27,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d37c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:20:27, skipping insertion in model container [2024-11-14 03:20:27,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:27" (3/3) ... [2024-11-14 03:20:27,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2024-11-14 03:20:27,055 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:20:27,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-31.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:20:27,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:20:27,133 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;@58b7bf0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:20:27,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:20:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:20:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-14 03:20:27,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:27,149 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:27,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:27,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1826797769, now seen corresponding path program 1 times [2024-11-14 03:20:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378925462] [2024-11-14 03:20:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:27,171 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 03:20:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:27,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:27,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:27,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 03:20:27,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-14 03:20:27,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:27,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378925462] [2024-11-14 03:20:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378925462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:20:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888759388] [2024-11-14 03:20:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:27,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:20:27,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:20:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:20:27,661 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:20:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:27,705 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-14 03:20:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:20:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-14 03:20:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:27,717 INFO L225 Difference]: With dead ends: 164 [2024-11-14 03:20:27,717 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 03:20:27,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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 03:20:27,728 INFO L432 NwaCegarLoop]: 114 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, 114 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 03:20:27,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:20:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 03:20:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 03:20:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:20:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-14 03:20:27,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-14 03:20:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:27,785 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-14 03:20:27,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:20:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-14 03:20:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-14 03:20:27,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:27,791 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:27,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:20:27,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:27,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:27,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash 529969649, now seen corresponding path program 1 times [2024-11-14 03:20:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012604667] [2024-11-14 03:20:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:27,994 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 03:20:27,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:27,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:27,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:28,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:28,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:28,378 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 21 treesize of output 9 [2024-11-14 03:20:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:20:28,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:28,423 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012604667] [2024-11-14 03:20:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012604667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229801116] [2024-11-14 03:20:28,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:28,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:28,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:28,426 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:20:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:28,472 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2024-11-14 03:20:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-14 03:20:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:28,474 INFO L225 Difference]: With dead ends: 157 [2024-11-14 03:20:28,474 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 03:20:28,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:28,476 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:28,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:20:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 03:20:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 03:20:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:20:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-14 03:20:28,484 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2024-11-14 03:20:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:28,486 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-14 03:20:28,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:20:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-14 03:20:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-14 03:20:28,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:28,488 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:28,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:28,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:28,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:28,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1058378253, now seen corresponding path program 1 times [2024-11-14 03:20:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091044961] [2024-11-14 03:20:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:28,690 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 03:20:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:28,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:28,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:29,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:20:29,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:30,042 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 03:20:30,462 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 18 treesize of output 13 [2024-11-14 03:20:30,831 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 18 treesize of output 13 [2024-11-14 03:20:30,885 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:20:31,053 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 44 treesize of output 38 [2024-11-14 03:20:31,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:31,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2024-11-14 03:20:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:20:31,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:32,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse5 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg (select .cse5 .cse1)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) |c_~#double_Array_0~0.base| v_ArrVal_71))) (let ((.cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (select .cse0 .cse1) .cse2)))) |c_~#unsigned_char_Array_0~0.base|) .cse4)))) (_ bv2 32)) .cse2))))) is different from false [2024-11-14 03:20:32,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_69 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse5 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_69))) (let ((.cse4 (store (store .cse1 |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg (select .cse6 .cse3)) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_69 .cse5))))))) |c_~#double_Array_0~0.base| v_ArrVal_71))) (let ((.cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#unsigned_char_Array_0~0.base|) .cse5)))) (_ bv2 32)))) (= .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse4 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (select .cse2 .cse3) .cse0)))) |c_~#unsigned_char_Array_0~0.base|) .cse5)))))))))) is different from false [2024-11-14 03:20:32,939 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091044961] [2024-11-14 03:20:32,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091044961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1688655982] [2024-11-14 03:20:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:32,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:20:32,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:20:32,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-14 03:20:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:34,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:20:34,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:34,940 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 03:20:35,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 16 treesize of output 11 [2024-11-14 03:20:35,788 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2024-11-14 03:20:35,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:35,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-14 03:20:36,209 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 53 treesize of output 43 [2024-11-14 03:20:36,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:36,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2024-11-14 03:20:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:20:37,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:38,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|)))))) |c_~#double_Array_0~0.base| v_ArrVal_71))) (let ((.cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| (let ((.cse1 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (store .cse1 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (select .cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse2)))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)) .cse2))))) is different from false [2024-11-14 03:20:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1688655982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:38,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672048308] [2024-11-14 03:20:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:38,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:38,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:38,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:38,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:20:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:39,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:20:39,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:39,921 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 19 treesize of output 1 [2024-11-14 03:20:40,178 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 18 treesize of output 13 [2024-11-14 03:20:40,479 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 18 treesize of output 13 [2024-11-14 03:20:40,536 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:20:40,619 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 44 treesize of output 38 [2024-11-14 03:20:40,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:40,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2024-11-14 03:20:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 03:20:40,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:41,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse5 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|)) (.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_126))) (let ((.cse4 (store (store .cse0 |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg (select .cse6 .cse2)) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_126 .cse5))))))) |c_~#double_Array_0~0.base| v_ArrVal_71))) (let ((.cse3 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#unsigned_char_Array_0~0.base|) .cse5))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse1 (select .cse4 |c_~#signed_long_int_Array_0~0.base|))) (store .cse1 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (select .cse1 .cse2) .cse3)))) |c_~#unsigned_char_Array_0~0.base|) .cse5))))) .cse3))))) is different from false [2024-11-14 03:20:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672048308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:41,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:20:41,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 20 [2024-11-14 03:20:41,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135735710] [2024-11-14 03:20:41,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:41,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 03:20:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:41,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 03:20:41,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=481, Unknown=5, NotChecked=196, Total=812 [2024-11-14 03:20:41,394 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 21 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-14 03:20:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:48,862 INFO L93 Difference]: Finished difference Result 278 states and 388 transitions. [2024-11-14 03:20:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:20:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) Word has length 94 [2024-11-14 03:20:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:48,866 INFO L225 Difference]: With dead ends: 278 [2024-11-14 03:20:48,866 INFO L226 Difference]: Without dead ends: 201 [2024-11-14 03:20:48,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=301, Invalid=1042, Unknown=5, NotChecked=292, Total=1640 [2024-11-14 03:20:48,869 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 577 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:48,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 505 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-14 03:20:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-14 03:20:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 88. [2024-11-14 03:20:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:20:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-14 03:20:48,885 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 94 [2024-11-14 03:20:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:48,885 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-14 03:20:48,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-14 03:20:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-14 03:20:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-14 03:20:48,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:48,887 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:48,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:49,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-14 03:20:49,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:20:49,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:49,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:49,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1412940558, now seen corresponding path program 1 times [2024-11-14 03:20:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:49,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779497603] [2024-11-14 03:20:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:49,490 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 03:20:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:49,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:49,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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)] Waiting until timeout for monitored process [2024-11-14 03:20:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:49,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:49,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:49,766 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 21 treesize of output 9 [2024-11-14 03:20:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:20:49,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:49,793 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779497603] [2024-11-14 03:20:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779497603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:49,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295213087] [2024-11-14 03:20:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:49,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:49,795 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:20:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:49,825 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2024-11-14 03:20:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-14 03:20:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:49,831 INFO L225 Difference]: With dead ends: 173 [2024-11-14 03:20:49,831 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 03:20:49,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:49,833 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:49,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:20:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 03:20:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-14 03:20:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:20:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-11-14 03:20:49,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 96 [2024-11-14 03:20:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:49,853 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-11-14 03:20:49,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:20:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-14 03:20:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-14 03:20:49,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:49,856 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:49,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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)] Ended with exit code 0 [2024-11-14 03:20:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:50,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:50,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1019913548, now seen corresponding path program 1 times [2024-11-14 03:20:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769602185] [2024-11-14 03:20:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:50,059 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 03:20:50,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:50,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:20:50,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 03:20:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:50,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:20:50,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:50,948 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 03:20:51,238 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 18 treesize of output 13 [2024-11-14 03:20:51,499 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 18 treesize of output 13 [2024-11-14 03:20:51,542 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:20:51,670 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 44 treesize of output 38 [2024-11-14 03:20:51,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:51,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2024-11-14 03:20:52,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 62 [2024-11-14 03:20:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:20:52,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:52,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_178))) (let ((.cse0 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (let ((.cse2 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (bvneg .cse2))))))) is different from false [2024-11-14 03:20:53,017 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse5 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse1 (bvadd (bvneg (select .cse6 .cse5)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) |c_~#double_Array_0~0.base| v_ArrVal_178))) (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 .cse1) (let ((.cse4 (select .cse0 .cse5))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_178) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse4))) |c_~#unsigned_char_Array_0~0.base|) .cse3))) (bvneg .cse4)))))))) is different from false [2024-11-14 03:20:53,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse6 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse5 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_176))) (let ((.cse4 (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| (let ((.cse7 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse7 .cse1 (bvadd (bvneg (select .cse7 .cse6)) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_176 .cse5))))))) |c_~#double_Array_0~0.base| v_ArrVal_178))) (let ((.cse0 (select .cse4 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 .cse1) (let ((.cse2 (select .cse0 .cse6))) (bvadd (bvneg .cse2) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse3 |c_~#double_Array_0~0.base| v_ArrVal_178) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#unsigned_char_Array_0~0.base|) .cse5))))) .cse2))) |c_~#unsigned_char_Array_0~0.base|) .cse5)))))))))) is different from false [2024-11-14 03:20:53,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769602185] [2024-11-14 03:20:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769602185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:53,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [463057984] [2024-11-14 03:20:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:20:53,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:20:53,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-14 03:20:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:54,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:20:54,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:55,284 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 03:20:55,898 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 16 treesize of output 11 [2024-11-14 03:20:56,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-14 03:20:56,428 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 0 case distinctions, treesize of input 45 treesize of output 42 [2024-11-14 03:20:56,653 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 49 treesize of output 39 [2024-11-14 03:20:56,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2024-11-14 03:20:57,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 67 [2024-11-14 03:20:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:20:57,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:57,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_206))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))) (select .cse2 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-14 03:20:58,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd (bvneg (select .cse6 .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) |c_~#double_Array_0~0.base| v_ArrVal_206))) (let ((.cse1 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse0 (select .cse1 .cse4))) (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_206) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) (select .cse1 .cse5)))))) is different from false [2024-11-14 03:20:58,252 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse8 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 |c_~#unsigned_char_Array_0~0.offset|))))) (let ((.cse1 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse6 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store .cse9 .cse5 .cse8)))) (let ((.cse4 (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| (let ((.cse7 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse7 .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse8)) (bvneg (select .cse7 .cse6)))))) |c_~#double_Array_0~0.base| v_ArrVal_206))) (let ((.cse0 (select .cse4 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 .cse1) (let ((.cse2 (select .cse0 .cse6))) (bvadd (bvneg .cse2) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse3 |c_~#double_Array_0~0.base| v_ArrVal_206) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#unsigned_char_Array_0~0.base|) .cse5))))) .cse2))) |c_~#unsigned_char_Array_0~0.base|) .cse5)))))))))))) is different from false [2024-11-14 03:20:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [463057984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317201908] [2024-11-14 03:20:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:58,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:58,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:58,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:58,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:20:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:58,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:20:58,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:59,218 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 19 treesize of output 1 [2024-11-14 03:20:59,448 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 18 treesize of output 13 [2024-11-14 03:20:59,770 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-14 03:20:59,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:59,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2024-11-14 03:21:00,238 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 59 treesize of output 49 [2024-11-14 03:21:00,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:00,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 67 [2024-11-14 03:21:01,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:01,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 67 [2024-11-14 03:21:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 03:21:01,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:02,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd (bvneg (select .cse6 .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2))))))) |c_~#double_Array_0~0.base| v_ArrVal_235))) (let ((.cse0 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse3 (select .cse0 .cse4))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_235) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse2))))) .cse3))) |c_~#unsigned_char_Array_0~0.base|) .cse2))) (bvneg .cse3))) (select .cse0 .cse5)))))) is different from false [2024-11-14 03:21:02,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32))) (let ((.cse9 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse4 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|)) (.cse8 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 |~#unsigned_char_Array_0~0.offset|))))) (let ((.cse6 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse5 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store .cse9 .cse4 .cse8)))) (let ((.cse3 (store (store .cse1 |c_~#signed_long_int_Array_0~0.base| (let ((.cse7 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (store .cse7 .cse6 (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse8)) (bvneg (select .cse7 .cse5)))))) |c_~#double_Array_0~0.base| v_ArrVal_235))) (let ((.cse2 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse0 (select .cse2 .cse5))) (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_235) |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse4))))) (select .cse2 .cse6)))))))) is different from false [2024-11-14 03:21:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317201908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:02,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:21:02,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 25 [2024-11-14 03:21:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020683393] [2024-11-14 03:21:02,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:02,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 03:21:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 03:21:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=724, Unknown=27, NotChecked=504, Total=1406 [2024-11-14 03:21:02,557 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 26 states, 24 states have (on average 4.291666666666667) internal successors, (103), 25 states have internal predecessors, (103), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-14 03:21:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:12,674 INFO L93 Difference]: Finished difference Result 294 states and 401 transitions. [2024-11-14 03:21:12,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 03:21:12,678 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.291666666666667) internal successors, (103), 25 states have internal predecessors, (103), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) Word has length 96 [2024-11-14 03:21:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:12,680 INFO L225 Difference]: With dead ends: 294 [2024-11-14 03:21:12,680 INFO L226 Difference]: Without dead ends: 209 [2024-11-14 03:21:12,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=475, Invalid=1969, Unknown=38, NotChecked=824, Total=3306 [2024-11-14 03:21:12,682 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 680 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:12,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 622 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 03:21:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-14 03:21:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 90. [2024-11-14 03:21:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:21:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-11-14 03:21:12,697 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 96 [2024-11-14 03:21:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-11-14 03:21:12,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.291666666666667) internal successors, (103), 25 states have internal predecessors, (103), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-14 03:21:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-11-14 03:21:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-14 03:21:12,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:12,699 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:12,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-14 03:21:12,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 03:21:13,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:21:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:13,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:13,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:13,301 INFO L85 PathProgramCache]: Analyzing trace with hash -490676581, now seen corresponding path program 1 times [2024-11-14 03:21:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732753695] [2024-11-14 03:21:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:13,303 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 03:21:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:13,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:13,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (11)] Waiting until timeout for monitored process [2024-11-14 03:21:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:13,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 03:21:13,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:14,108 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 03:21:14,402 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 18 treesize of output 13 [2024-11-14 03:21:14,646 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 18 treesize of output 13 [2024-11-14 03:21:14,685 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:21:14,796 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 44 treesize of output 38 [2024-11-14 03:21:14,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:14,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2024-11-14 03:21:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:21:14,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:15,384 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:15,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732753695] [2024-11-14 03:21:15,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732753695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:15,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1073821699] [2024-11-14 03:21:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:15,384 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:15,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:15,386 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:15,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-14 03:21:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:15,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:21:16,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:16,402 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 14 treesize of output 10 [2024-11-14 03:21:16,711 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 19 treesize of output 14 [2024-11-14 03:21:16,898 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 19 treesize of output 14 [2024-11-14 03:21:17,217 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 19 treesize of output 14 [2024-11-14 03:21:17,477 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 19 treesize of output 14 [2024-11-14 03:21:17,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 19 treesize of output 14 [2024-11-14 03:21:17,845 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 19 treesize of output 14 [2024-11-14 03:21:17,884 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 19 treesize of output 14 [2024-11-14 03:21:18,148 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 29 treesize of output 22 [2024-11-14 03:21:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-14 03:21:18,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1073821699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:21:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2024-11-14 03:21:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659067486] [2024-11-14 03:21:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:21:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:21:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=384, Unknown=13, NotChecked=0, Total=462 [2024-11-14 03:21:18,276 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:21:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:19,758 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2024-11-14 03:21:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:19,759 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-14 03:21:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:19,760 INFO L225 Difference]: With dead ends: 217 [2024-11-14 03:21:19,761 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 03:21:19,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=494, Unknown=13, NotChecked=0, Total=600 [2024-11-14 03:21:19,762 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 241 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:19,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 306 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:21:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 03:21:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-14 03:21:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.309090909090909) internal successors, (144), 111 states have internal predecessors, (144), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 03:21:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 170 transitions. [2024-11-14 03:21:19,784 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 170 transitions. Word has length 96 [2024-11-14 03:21:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:19,785 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 170 transitions. [2024-11-14 03:21:19,785 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:21:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 170 transitions. [2024-11-14 03:21:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-14 03:21:19,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:19,787 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:19,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:19,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-14 03:21:20,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:20,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:20,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -81200918, now seen corresponding path program 1 times [2024-11-14 03:21:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684514769] [2024-11-14 03:21:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:20,190 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 03:21:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:20,192 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:20,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:20,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:21:20,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:20,865 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 03:21:21,308 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 20 treesize of output 15 [2024-11-14 03:21:21,598 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 20 treesize of output 15 [2024-11-14 03:21:21,912 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 20 treesize of output 15 [2024-11-14 03:21:22,211 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 20 treesize of output 15 [2024-11-14 03:21:22,532 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 20 treesize of output 15 [2024-11-14 03:21:22,606 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 20 treesize of output 15 [2024-11-14 03:21:22,641 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 20 treesize of output 15 [2024-11-14 03:21:22,745 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 31 treesize of output 24 [2024-11-14 03:21:22,793 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 33 treesize of output 15 [2024-11-14 03:21:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-14 03:21:22,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:23,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_324)) (.cse1 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (or (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_325) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))))) is different from false [2024-11-14 03:21:23,376 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684514769] [2024-11-14 03:21:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684514769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2019106349] [2024-11-14 03:21:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:23,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:23,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:23,379 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:23,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 03:21:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:24,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:21:24,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:24,287 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 14 treesize of output 10 [2024-11-14 03:21:24,637 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 19 treesize of output 14 [2024-11-14 03:21:24,826 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 19 treesize of output 14 [2024-11-14 03:21:25,091 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 19 treesize of output 14 [2024-11-14 03:21:25,352 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 19 treesize of output 14 [2024-11-14 03:21:25,647 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 19 treesize of output 14 [2024-11-14 03:21:25,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 19 treesize of output 14 [2024-11-14 03:21:25,794 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 19 treesize of output 14 [2024-11-14 03:21:25,971 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 30 treesize of output 23 [2024-11-14 03:21:26,072 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 32 treesize of output 14 [2024-11-14 03:21:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-14 03:21:26,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2019106349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:26,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:21:26,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-14 03:21:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111340791] [2024-11-14 03:21:26,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:26,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:21:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:26,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:21:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=382, Unknown=29, NotChecked=42, Total=552 [2024-11-14 03:21:26,120 INFO L87 Difference]: Start difference. First operand 127 states and 170 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:21:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:27,173 INFO L93 Difference]: Finished difference Result 251 states and 331 transitions. [2024-11-14 03:21:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2024-11-14 03:21:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:27,178 INFO L225 Difference]: With dead ends: 251 [2024-11-14 03:21:27,178 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 03:21:27,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=487, Unknown=31, NotChecked=48, Total=702 [2024-11-14 03:21:27,179 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 236 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:27,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 221 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:21:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 03:21:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2024-11-14 03:21:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 79 states have internal predecessors, (101), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:21:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 123 transitions. [2024-11-14 03:21:27,194 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 123 transitions. Word has length 97 [2024-11-14 03:21:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:27,195 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 123 transitions. [2024-11-14 03:21:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:21:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2024-11-14 03:21:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-14 03:21:27,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:27,196 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:27,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:27,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-14 03:21:27,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:27,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:27,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash -928397417, now seen corresponding path program 1 times [2024-11-14 03:21:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:27,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248523373] [2024-11-14 03:21:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:27,600 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 03:21:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:27,602 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:27,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (15)] Waiting until timeout for monitored process [2024-11-14 03:21:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:27,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:21:28,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:28,687 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 12 treesize of output 8 [2024-11-14 03:21:28,976 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-14 03:21:29,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 29 treesize of output 22 [2024-11-14 03:21:29,103 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 29 treesize of output 22 [2024-11-14 03:21:29,187 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 29 treesize of output 22 [2024-11-14 03:21:29,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:29,372 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 65 treesize of output 35 [2024-11-14 03:21:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-14 03:21:29,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:29,447 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:29,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248523373] [2024-11-14 03:21:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248523373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:21:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512948903] [2024-11-14 03:21:29,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:21:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:29,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:21:29,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:21:29,449 INFO L87 Difference]: Start difference. First operand 94 states and 123 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:21:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:31,060 INFO L93 Difference]: Finished difference Result 237 states and 313 transitions. [2024-11-14 03:21:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:21:31,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-11-14 03:21:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:31,063 INFO L225 Difference]: With dead ends: 237 [2024-11-14 03:21:31,063 INFO L226 Difference]: Without dead ends: 146 [2024-11-14 03:21:31,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:21:31,064 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 246 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:31,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 313 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 03:21:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-14 03:21:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2024-11-14 03:21:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:21:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2024-11-14 03:21:31,079 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 98 [2024-11-14 03:21:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:31,079 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2024-11-14 03:21:31,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:21:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2024-11-14 03:21:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-14 03:21:31,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:31,082 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:31,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (15)] Ended with exit code 0 [2024-11-14 03:21:31,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:31,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:31,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1261902014, now seen corresponding path program 1 times [2024-11-14 03:21:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:31,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371258121] [2024-11-14 03:21:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:31,284 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 03:21:31,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:31,286 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:31,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:31,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 03:21:31,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:32,079 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 03:21:32,393 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 18 treesize of output 13 [2024-11-14 03:21:32,650 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 18 treesize of output 13 [2024-11-14 03:21:32,684 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:21:32,786 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 44 treesize of output 38 [2024-11-14 03:21:32,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:32,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2024-11-14 03:21:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:21:32,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:33,239 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371258121] [2024-11-14 03:21:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371258121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021281675] [2024-11-14 03:21:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:33,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:33,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:33,241 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:33,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-14 03:21:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:34,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:21:34,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:35,004 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 03:21:35,225 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 03:21:35,423 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 03:21:35,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-11-14 03:21:35,584 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 31 treesize of output 27 [2024-11-14 03:21:35,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2024-11-14 03:21:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:21:36,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1021281675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:36,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:21:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2024-11-14 03:21:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126312886] [2024-11-14 03:21:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:36,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:21:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:21:36,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=352, Unknown=10, NotChecked=0, Total=420 [2024-11-14 03:21:36,067 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:21:40,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:42,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:42,570 INFO L93 Difference]: Finished difference Result 304 states and 401 transitions. [2024-11-14 03:21:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:21:42,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-14 03:21:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:42,572 INFO L225 Difference]: With dead ends: 304 [2024-11-14 03:21:42,573 INFO L226 Difference]: Without dead ends: 181 [2024-11-14 03:21:42,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=673, Unknown=10, NotChecked=0, Total=812 [2024-11-14 03:21:42,574 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 164 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:42,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 382 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 435 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2024-11-14 03:21:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-14 03:21:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2024-11-14 03:21:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:21:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2024-11-14 03:21:42,588 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 99 [2024-11-14 03:21:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:42,589 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2024-11-14 03:21:42,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:21:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2024-11-14 03:21:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-14 03:21:42,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:42,590 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:42,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:42,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:42,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:42,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:42,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2011996928, now seen corresponding path program 1 times [2024-11-14 03:21:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219122212] [2024-11-14 03:21:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:42,991 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 03:21:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:42,995 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:42,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (18)] Waiting until timeout for monitored process [2024-11-14 03:21:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:43,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:21:43,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:21:43,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:43,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219122212] [2024-11-14 03:21:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219122212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:43,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:21:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840531193] [2024-11-14 03:21:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:21:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:21:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:43,424 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:21:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:44,092 INFO L93 Difference]: Finished difference Result 322 states and 429 transitions. [2024-11-14 03:21:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:44,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-14 03:21:44,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:44,094 INFO L225 Difference]: With dead ends: 322 [2024-11-14 03:21:44,094 INFO L226 Difference]: Without dead ends: 189 [2024-11-14 03:21:44,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:21:44,095 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:44,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 388 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:21:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-14 03:21:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2024-11-14 03:21:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:21:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 195 transitions. [2024-11-14 03:21:44,109 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 195 transitions. Word has length 99 [2024-11-14 03:21:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:44,110 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 195 transitions. [2024-11-14 03:21:44,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:21:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 195 transitions. [2024-11-14 03:21:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-14 03:21:44,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:44,111 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:44,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (18)] Ended with exit code 0 [2024-11-14 03:21:44,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:44,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash 423649026, now seen corresponding path program 1 times [2024-11-14 03:21:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889967711] [2024-11-14 03:21:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:44,313 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 03:21:44,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:44,314 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:44,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (19)] Waiting until timeout for monitored process [2024-11-14 03:21:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:44,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:21:44,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:21:44,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:44,609 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889967711] [2024-11-14 03:21:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889967711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:44,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:21:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506828170] [2024-11-14 03:21:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:21:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:21:44,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:44,610 INFO L87 Difference]: Start difference. First operand 146 states and 195 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:21:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:45,165 INFO L93 Difference]: Finished difference Result 320 states and 419 transitions. [2024-11-14 03:21:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:21:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-14 03:21:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:45,167 INFO L225 Difference]: With dead ends: 320 [2024-11-14 03:21:45,167 INFO L226 Difference]: Without dead ends: 177 [2024-11-14 03:21:45,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:21:45,168 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 39 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:45,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 377 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:21:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-14 03:21:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2024-11-14 03:21:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 119 states have (on average 1.26890756302521) internal successors, (151), 119 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:21:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2024-11-14 03:21:45,181 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 99 [2024-11-14 03:21:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:45,181 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2024-11-14 03:21:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:21:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2024-11-14 03:21:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-14 03:21:45,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:45,183 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:21:45,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (19)] Ended with exit code 0 [2024-11-14 03:21:45,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:45,383 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:21:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash -541076033, now seen corresponding path program 1 times [2024-11-14 03:21:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:45,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78603702] [2024-11-14 03:21:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:45,384 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 03:21:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:45,386 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:21:45,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (20)] Waiting until timeout for monitored process [2024-11-14 03:21:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:45,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 03:21:45,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:45,994 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 28 treesize of output 26 [2024-11-14 03:21:46,449 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 28 treesize of output 26 [2024-11-14 03:21:46,873 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 28 treesize of output 26 [2024-11-14 03:21:47,144 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-14 03:21:47,154 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 7 treesize of output 3 [2024-11-14 03:21:47,493 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 19 treesize of output 14 [2024-11-14 03:21:48,072 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 03:21:48,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:48,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2024-11-14 03:21:49,227 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 86 treesize of output 72 [2024-11-14 03:21:49,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:49,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 82 [2024-11-14 03:21:50,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:50,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 50 [2024-11-14 03:21:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 33 proven. 153 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-14 03:21:50,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:51,069 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_508) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul (select .cse0 |c_~#signed_long_int_Array_0~0.offset|) c_~last_1_signed_long_int_Array_0_1__0_~0)))))) is different from false [2024-11-14 03:21:51,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_508) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse1 .cse0) (bvmul (select .cse1 |c_~#signed_long_int_Array_0~0.offset|) c_~last_1_signed_long_int_Array_0_1__0_~0))))))) is different from false [2024-11-14 03:21:51,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|)) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse3 (select .cse5 .cse1)) (.cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg .cse3) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))) (or (forall ((v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_508) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 .cse1) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse4)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))))) is different from false [2024-11-14 03:21:52,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:52,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78603702] [2024-11-14 03:21:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78603702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:52,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [369793195] [2024-11-14 03:21:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:52,697 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:52,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:52,699 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:52,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 03:21:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:53,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:21:53,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:54,770 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 03:21:55,030 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 03:21:55,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 16 treesize of output 11 [2024-11-14 03:21:56,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-14 03:21:56,954 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 52 treesize of output 42 [2024-11-14 03:21:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2024-11-14 03:21:58,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 55 [2024-11-14 03:21:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:21:58,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:58,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_535) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-14 03:22:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [369793195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404175555] [2024-11-14 03:22:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:08,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:08,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:08,982 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:08,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:22:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:09,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:22:09,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:09,672 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 9 treesize of output 3 [2024-11-14 03:22:18,089 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 38 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:22:18,089 INFO L349 Elim1Store]: treesize reduction 54, result has 26.0 percent of original size [2024-11-14 03:22:18,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 56 [2024-11-14 03:22:19,011 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 03:22:19,011 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 85 [2024-11-14 03:22:19,074 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 24 treesize of output 20 [2024-11-14 03:22:44,541 WARN L286 SmtUtils]: Spent 24.77s on a formula simplification. DAG size of input: 47 DAG size of output: 29 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:22:44,541 INFO L349 Elim1Store]: treesize reduction 42, result has 52.8 percent of original size [2024-11-14 03:22:44,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 143 treesize of output 140 [2024-11-14 03:22:47,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:47,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 79 [2024-11-14 03:22:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:22:47,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:22:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404175555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:47,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:22:47,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 13] total 37 [2024-11-14 03:22:47,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697110111] [2024-11-14 03:22:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:47,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:22:47,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:22:47,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:22:47,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1705, Unknown=10, NotChecked=356, Total=2352 [2024-11-14 03:22:47,402 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:22:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:57,591 INFO L93 Difference]: Finished difference Result 483 states and 621 transitions. [2024-11-14 03:22:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:22:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-14 03:22:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:57,594 INFO L225 Difference]: With dead ends: 483 [2024-11-14 03:22:57,594 INFO L226 Difference]: Without dead ends: 352 [2024-11-14 03:22:57,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=345, Invalid=2111, Unknown=10, NotChecked=396, Total=2862 [2024-11-14 03:22:57,596 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 197 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:57,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 870 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-14 03:22:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-14 03:22:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 204. [2024-11-14 03:22:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 175 states have internal predecessors, (216), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:22:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2024-11-14 03:22:57,624 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 99 [2024-11-14 03:22:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:57,625 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2024-11-14 03:22:57,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:22:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2024-11-14 03:22:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-14 03:22:57,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:57,627 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:22:57,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-14 03:22:57,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (20)] Ended with exit code 0 [2024-11-14 03:22:58,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 03:22:58,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:58,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:22:58,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:58,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1652853115, now seen corresponding path program 1 times [2024-11-14 03:22:58,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:22:58,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039667886] [2024-11-14 03:22:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:58,229 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 03:22:58,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:22:58,231 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:22:58,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (23)] Waiting until timeout for monitored process [2024-11-14 03:22:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:58,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:22:58,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:22:58,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:22:58,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:22:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039667886] [2024-11-14 03:22:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039667886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:58,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:22:58,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:22:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932770888] [2024-11-14 03:22:58,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:58,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:22:58,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:22:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:22:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:22:58,557 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:22:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:58,692 INFO L93 Difference]: Finished difference Result 338 states and 434 transitions. [2024-11-14 03:22:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:22:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-14 03:22:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:58,696 INFO L225 Difference]: With dead ends: 338 [2024-11-14 03:22:58,697 INFO L226 Difference]: Without dead ends: 207 [2024-11-14 03:22:58,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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 03:22:58,698 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:58,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:22:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-14 03:22:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-11-14 03:22:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 175 states have internal predecessors, (216), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:22:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2024-11-14 03:22:58,730 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 100 [2024-11-14 03:22:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:58,731 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2024-11-14 03:22:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:22:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2024-11-14 03:22:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-14 03:22:58,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:58,732 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:22:58,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (23)] Ended with exit code 0 [2024-11-14 03:22:58,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:22:58,933 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:22:58,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1018014364, now seen corresponding path program 1 times [2024-11-14 03:22:58,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:22:58,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748957674] [2024-11-14 03:22:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:58,934 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 03:22:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:22:58,938 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:22:58,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (24)] Waiting until timeout for monitored process [2024-11-14 03:22:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:59,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:22:59,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:00,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-11-14 03:23:01,298 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 141 treesize of output 110 [2024-11-14 03:23:02,015 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 141 treesize of output 110 [2024-11-14 03:23:02,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 141 treesize of output 110 [2024-11-14 03:23:03,724 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 141 treesize of output 110 [2024-11-14 03:23:03,918 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 141 treesize of output 110 [2024-11-14 03:23:04,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:04,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 208 treesize of output 106 [2024-11-14 03:23:04,347 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 216 treesize of output 169 [2024-11-14 03:23:05,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:05,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 404 treesize of output 142 [2024-11-14 03:23:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-14 03:23:05,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:23:06,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_611) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 03:23:06,288 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_611) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2024-11-14 03:23:06,359 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_609) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_611) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2024-11-14 03:23:06,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_608))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_609) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_611) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 03:23:06,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:23:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748957674] [2024-11-14 03:23:06,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748957674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:23:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1274236124] [2024-11-14 03:23:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:06,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:23:06,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:23:06,528 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:23:06,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-14 03:23:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:07,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:23:07,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:09,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:23:10,692 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 113 treesize of output 82 [2024-11-14 03:23:11,440 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 113 treesize of output 82 [2024-11-14 03:23:12,157 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 113 treesize of output 82 [2024-11-14 03:23:13,032 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 113 treesize of output 82 [2024-11-14 03:23:13,327 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 113 treesize of output 82 [2024-11-14 03:23:13,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2024-11-14 03:23:13,821 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 174 treesize of output 127 [2024-11-14 03:23:14,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 142 [2024-11-14 03:23:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-14 03:23:14,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:23:15,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_641) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 03:23:15,179 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_89| (_ BitVec 64))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_89|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_89|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_641) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_89|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:23:15,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_89| (_ BitVec 64)) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_639) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_89|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_89|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_641) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_89|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:23:15,329 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_89| (_ BitVec 64)) (v_ArrVal_638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_638))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_639) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_89|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_89|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_641) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_89|)))))))) is different from false [2024-11-14 03:23:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1274236124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:23:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055953642] [2024-11-14 03:23:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:23:15,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:23:15,411 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:23:15,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 03:23:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:15,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:23:15,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:16,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-11-14 03:23:30,318 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 131 treesize of output 102 [2024-11-14 03:23:31,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 131 treesize of output 102 [2024-11-14 03:23:32,180 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 131 treesize of output 102 [2024-11-14 03:23:33,095 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 131 treesize of output 102 [2024-11-14 03:23:35,838 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 131 treesize of output 102 [2024-11-14 03:23:35,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:35,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 198 treesize of output 102 [2024-11-14 03:23:36,585 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 216 treesize of output 169 [2024-11-14 03:23:37,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:37,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 404 treesize of output 142 [2024-11-14 03:23:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-14 03:23:37,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:23:37,681 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_674) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 03:23:37,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_94| (_ BitVec 64))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_94|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_94|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_674) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_94|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:23:37,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_94| (_ BitVec 64))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_670) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_94|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_94|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_674) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_94|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:23:37,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_94| (_ BitVec 64)) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_669))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_670) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_94|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_94|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_674) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_94|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 03:23:37,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055953642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:23:37,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:23:37,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2024-11-14 03:23:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323970913] [2024-11-14 03:23:37,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:23:37,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 03:23:37,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:23:37,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 03:23:37,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1006, Unknown=17, NotChecked=900, Total=2070 [2024-11-14 03:23:37,987 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand has 30 states, 30 states have (on average 4.366666666666666) internal successors, (131), 29 states have internal predecessors, (131), 6 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2024-11-14 03:23:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:23:53,514 INFO L93 Difference]: Finished difference Result 474 states and 595 transitions. [2024-11-14 03:23:53,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 03:23:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.366666666666666) internal successors, (131), 29 states have internal predecessors, (131), 6 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) Word has length 100 [2024-11-14 03:23:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:23:53,517 INFO L225 Difference]: With dead ends: 474 [2024-11-14 03:23:53,517 INFO L226 Difference]: Without dead ends: 472 [2024-11-14 03:23:53,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=354, Invalid=2029, Unknown=17, NotChecked=1260, Total=3660 [2024-11-14 03:23:53,519 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 590 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:23:53,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 627 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-11-14 03:23:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-14 03:23:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 363. [2024-11-14 03:23:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 316 states have internal predecessors, (390), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:23:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 462 transitions. [2024-11-14 03:23:53,562 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 462 transitions. Word has length 100 [2024-11-14 03:23:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:23:53,562 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 462 transitions. [2024-11-14 03:23:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.366666666666666) internal successors, (131), 29 states have internal predecessors, (131), 6 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2024-11-14 03:23:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 462 transitions. [2024-11-14 03:23:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-14 03:23:53,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:23:53,564 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:53,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (24)] Ended with exit code 0 [2024-11-14 03:23:53,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-14 03:23:53,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-14 03:23:54,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:23:54,165 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:23:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:23:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 50663710, now seen corresponding path program 1 times [2024-11-14 03:23:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:23:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832063652] [2024-11-14 03:23:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:54,166 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 03:23:54,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:23:54,168 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:23:54,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (27)] Waiting until timeout for monitored process [2024-11-14 03:23:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:54,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:23:54,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-14 03:23:54,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:23:54,454 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:23:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832063652] [2024-11-14 03:23:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832063652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:23:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:23:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:23:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964836087] [2024-11-14 03:23:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:23:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:23:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:23:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:23:54,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:23:54,456 INFO L87 Difference]: Start difference. First operand 363 states and 462 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:23:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:23:54,569 INFO L93 Difference]: Finished difference Result 651 states and 831 transitions. [2024-11-14 03:23:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:23:54,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-14 03:23:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:23:54,572 INFO L225 Difference]: With dead ends: 651 [2024-11-14 03:23:54,572 INFO L226 Difference]: Without dead ends: 363 [2024-11-14 03:23:54,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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 03:23:54,573 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:23:54,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:23:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-14 03:23:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-14 03:23:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 316 states have internal predecessors, (388), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:23:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 460 transitions. [2024-11-14 03:23:54,624 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 460 transitions. Word has length 100 [2024-11-14 03:23:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:23:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 460 transitions. [2024-11-14 03:23:54,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:23:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 460 transitions. [2024-11-14 03:23:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-14 03:23:54,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:23:54,626 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:54,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (27)] Ended with exit code 0 [2024-11-14 03:23:54,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:23:54,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:23:54,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:23:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash 458835129, now seen corresponding path program 1 times [2024-11-14 03:23:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:23:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379198293] [2024-11-14 03:23:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:54,828 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 03:23:54,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:23:54,830 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:23:54,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (28)] Waiting until timeout for monitored process [2024-11-14 03:23:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:55,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:23:55,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:55,593 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 28 treesize of output 26 [2024-11-14 03:23:56,185 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 28 treesize of output 26 [2024-11-14 03:23:56,737 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 28 treesize of output 26 [2024-11-14 03:23:57,117 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-14 03:23:57,131 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 7 treesize of output 3 [2024-11-14 03:23:57,572 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 19 treesize of output 14 [2024-11-14 03:23:58,367 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-11-14 03:23:59,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:59,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2024-11-14 03:24:00,779 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 105 treesize of output 85 [2024-11-14 03:24:01,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:01,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 92 [2024-11-14 03:24:02,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:02,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 86 [2024-11-14 03:24:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 41 proven. 153 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 03:24:02,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:07,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:24:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379198293] [2024-11-14 03:24:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379198293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [900239118] [2024-11-14 03:24:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:07,252 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:24:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:24:07,254 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:24:07,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 03:24:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:08,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:24:08,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:08,996 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 24 treesize of output 22 [2024-11-14 03:24:09,674 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 24 treesize of output 22 [2024-11-14 03:24:10,462 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 24 treesize of output 22 [2024-11-14 03:24:10,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-14 03:24:11,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-14 03:24:13,126 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 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-14 03:24:15,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-11-14 03:24:16,512 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 79 treesize of output 63 [2024-11-14 03:24:17,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 84 [2024-11-14 03:24:18,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 78 [2024-11-14 03:24:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 86 proven. 81 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-14 03:24:18,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:19,323 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_724 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_724) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|))))))) is different from false [2024-11-14 03:24:19,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_724 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_724) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse1 .cse0) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse1 |c_~#signed_long_int_Array_0~0.offset|)))))))) is different from false [2024-11-14 03:24:19,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|)) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse3 (select .cse5 .cse1)) (.cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg .cse3) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))) (or (forall ((v_ArrVal_724 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_724) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 .cse1) (bvmul (select .cse0 |c_~#signed_long_int_Array_0~0.offset|) c_~last_1_signed_long_int_Array_0_1__0_~0))))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse4)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))))) is different from false [2024-11-14 03:24:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [900239118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998005625] [2024-11-14 03:24:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:22,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:24:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:24:22,166 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:24:22,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 03:24:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:22,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:24:22,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:22,859 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 9 treesize of output 3 [2024-11-14 03:24:24,017 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 19 treesize of output 1 [2024-11-14 03:24:25,170 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 18 treesize of output 13 [2024-11-14 03:24:26,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:26,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2024-11-14 03:24:27,426 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 73 treesize of output 61 [2024-11-14 03:24:27,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:27,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 75 [2024-11-14 03:24:28,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:28,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 41 [2024-11-14 03:24:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:24:29,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:29,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_779) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-14 03:24:29,624 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_779) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|ULTIMATE.start_step_#t~mem15#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))) is different from false [2024-11-14 03:24:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998005625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:57,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:24:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 15] total 47 [2024-11-14 03:24:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941443251] [2024-11-14 03:24:57,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:24:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 03:24:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:24:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 03:24:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=3129, Unknown=76, NotChecked=620, Total=4422 [2024-11-14 03:24:57,469 INFO L87 Difference]: Start difference. First operand 363 states and 460 transitions. Second operand has 48 states, 45 states have (on average 3.6666666666666665) internal successors, (165), 47 states have internal predecessors, (165), 14 states have call successors, (33), 11 states have call predecessors, (33), 14 states have return successors, (33), 11 states have call predecessors, (33), 14 states have call successors, (33) [2024-11-14 03:25:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:25:15,685 INFO L93 Difference]: Finished difference Result 918 states and 1150 transitions. [2024-11-14 03:25:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:25:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 3.6666666666666665) internal successors, (165), 47 states have internal predecessors, (165), 14 states have call successors, (33), 11 states have call predecessors, (33), 14 states have return successors, (33), 11 states have call predecessors, (33), 14 states have call successors, (33) Word has length 101 [2024-11-14 03:25:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:25:15,690 INFO L225 Difference]: With dead ends: 918 [2024-11-14 03:25:15,691 INFO L226 Difference]: Without dead ends: 681 [2024-11-14 03:25:15,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=1189, Invalid=5560, Unknown=77, NotChecked=830, Total=7656 [2024-11-14 03:25:15,694 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 618 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:25:15,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1717 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-14 03:25:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-14 03:25:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 409. [2024-11-14 03:25:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 356 states have (on average 1.247191011235955) internal successors, (444), 356 states have internal predecessors, (444), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:25:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 516 transitions. [2024-11-14 03:25:15,747 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 516 transitions. Word has length 101 [2024-11-14 03:25:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:25:15,747 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 516 transitions. [2024-11-14 03:25:15,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 3.6666666666666665) internal successors, (165), 47 states have internal predecessors, (165), 14 states have call successors, (33), 11 states have call predecessors, (33), 14 states have return successors, (33), 11 states have call predecessors, (33), 14 states have call successors, (33) [2024-11-14 03:25:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 516 transitions. [2024-11-14 03:25:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-14 03:25:15,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:25:15,749 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:15,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 03:25:15,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (28)] Ended with exit code 0 [2024-11-14 03:25:16,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 03:25:16,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:25:16,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:25:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:25:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1357718402, now seen corresponding path program 1 times [2024-11-14 03:25:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:25:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224249304] [2024-11-14 03:25:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:16,351 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 03:25:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:25:16,355 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:25:16,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (31)] Waiting until timeout for monitored process [2024-11-14 03:25:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:16,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:25:16,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:25:17,518 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 30 treesize of output 1 [2024-11-14 03:25:18,579 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 119 treesize of output 92 [2024-11-14 03:25:19,090 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 119 treesize of output 92 [2024-11-14 03:25:19,646 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 119 treesize of output 92 [2024-11-14 03:25:20,304 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 119 treesize of output 92 [2024-11-14 03:25:20,470 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 119 treesize of output 92 [2024-11-14 03:25:20,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:25:20,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 186 treesize of output 96 [2024-11-14 03:25:20,810 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 194 treesize of output 151 [2024-11-14 03:25:21,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:25:21,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 132 [2024-11-14 03:25:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-14 03:25:21,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:25:23,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:25:23,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_810) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:25:23,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_809))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_810) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 03:25:23,450 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:25:23,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224249304] [2024-11-14 03:25:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224249304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:25:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723161997] [2024-11-14 03:25:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:23,451 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:25:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:25:23,455 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:25:23,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-14 03:25:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:24,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:25:24,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:25:25,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:25:32,660 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 111 treesize of output 80 [2024-11-14 03:25:33,550 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 111 treesize of output 80 [2024-11-14 03:25:34,397 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 111 treesize of output 80 [2024-11-14 03:25:35,318 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 111 treesize of output 80 [2024-11-14 03:25:35,679 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 111 treesize of output 80 [2024-11-14 03:25:35,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 98 [2024-11-14 03:25:36,381 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 145 treesize of output 116 [2024-11-14 03:25:37,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 149 [2024-11-14 03:25:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-14 03:25:37,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:25:38,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_115| (_ BitVec 64)) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_115|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_115|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_115|))))))) is different from false [2024-11-14 03:25:38,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_115| (_ BitVec 64)) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_842) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_115|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_115|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_115|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:25:38,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_115| (_ BitVec 64)) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_841))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_842) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_115|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_115|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_115|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 03:25:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1723161997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:25:38,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415199977] [2024-11-14 03:25:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:38,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:25:38,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:25:38,530 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:25:38,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 03:25:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:38,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 03:25:38,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:25:40,078 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 25 treesize of output 10 [2024-11-14 03:25:57,986 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 74 treesize of output 57 [2024-11-14 03:25:58,464 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 74 treesize of output 57 [2024-11-14 03:25:58,993 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 74 treesize of output 57 [2024-11-14 03:25:59,655 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 74 treesize of output 57 [2024-11-14 03:26:04,030 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 74 treesize of output 57 [2024-11-14 03:26:04,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:26:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 141 treesize of output 81 [2024-11-14 03:26:04,650 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 149 treesize of output 116 [2024-11-14 03:26:05,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:26:05,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 117 [2024-11-14 03:26:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 139 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-14 03:26:05,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:06,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_120|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_120|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:26:06,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (v_ArrVal_874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_874) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_120|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_120|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:26:06,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (v_ArrVal_874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_873))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_874) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_120|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_120|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_814) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 03:26:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415199977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:06,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:26:06,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 21] total 43 [2024-11-14 03:26:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007502987] [2024-11-14 03:26:06,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:26:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:26:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:26:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:26:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2151, Unknown=39, NotChecked=918, Total=3306 [2024-11-14 03:26:06,541 INFO L87 Difference]: Start difference. First operand 409 states and 516 transitions. Second operand has 44 states, 41 states have (on average 3.658536585365854) internal successors, (150), 40 states have internal predecessors, (150), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-14 03:26:08,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:09,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:11,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:15,127 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 [0] [2024-11-14 03:26:17,132 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 03:26:19,174 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 03:26:21,193 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 03:26:25,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:29,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:31,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:34,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:36,215 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 03:26:38,283 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 03:26:40,330 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 03:26:42,387 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 03:26:46,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:48,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:51,442 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 03:26:56,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:00,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:04,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:06,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:09,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:11,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:13,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:15,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:17,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:19,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:23,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:25,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:27,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:05,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:08,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:10,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:12,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:14,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:25,708 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 03:28:27,731 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 03:28:29,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s 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 03:28:31,429 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 03:28:36,655 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 03:28:37,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s 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 03:28:39,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:41,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:28:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:42,638 INFO L93 Difference]: Finished difference Result 863 states and 1069 transitions. [2024-11-14 03:28:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-14 03:28:42,640 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 3.658536585365854) internal successors, (150), 40 states have internal predecessors, (150), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) Word has length 102 [2024-11-14 03:28:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:42,645 INFO L225 Difference]: With dead ends: 863 [2024-11-14 03:28:42,645 INFO L226 Difference]: Without dead ends: 861 [2024-11-14 03:28:42,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 328 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1861 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=880, Invalid=6410, Unknown=56, NotChecked=1584, Total=8930 [2024-11-14 03:28:42,648 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 807 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 4419 mSolverCounterSat, 253 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 4711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 4419 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 113.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:42,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1872 Invalid, 4711 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [253 Valid, 4419 Invalid, 39 Unknown, 0 Unchecked, 113.0s Time] [2024-11-14 03:28:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-14 03:28:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 434. [2024-11-14 03:28:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 373 states have (on average 1.2359249329758712) internal successors, (461), 374 states have internal predecessors, (461), 40 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-14 03:28:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 541 transitions. [2024-11-14 03:28:42,735 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 541 transitions. Word has length 102 [2024-11-14 03:28:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:42,735 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 541 transitions. [2024-11-14 03:28:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 3.658536585365854) internal successors, (150), 40 states have internal predecessors, (150), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-14 03:28:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 541 transitions. [2024-11-14 03:28:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-14 03:28:42,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:42,737 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:28:42,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 03:28:42,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (31)] Ended with exit code 0 [2024-11-14 03:28:43,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-14 03:28:43,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:28:43,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:28:43,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1028791104, now seen corresponding path program 1 times [2024-11-14 03:28:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:28:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233088676] [2024-11-14 03:28:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:43,340 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 03:28:43,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:28:43,342 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:28:43,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (34)] Waiting until timeout for monitored process [2024-11-14 03:28:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:43,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:28:43,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:28:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 03:28:43,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:28:43,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:28:43,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233088676] [2024-11-14 03:28:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233088676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:28:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921094446] [2024-11-14 03:28:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:28:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:28:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:28:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:28:43,744 INFO L87 Difference]: Start difference. First operand 434 states and 541 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 03:28:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:44,151 INFO L93 Difference]: Finished difference Result 695 states and 864 transitions. [2024-11-14 03:28:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:28:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2024-11-14 03:28:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:44,154 INFO L225 Difference]: With dead ends: 695 [2024-11-14 03:28:44,154 INFO L226 Difference]: Without dead ends: 357 [2024-11-14 03:28:44,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:28:44,156 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:44,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:28:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-14 03:28:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 345. [2024-11-14 03:28:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 305 states have (on average 1.2262295081967214) internal successors, (374), 306 states have internal predecessors, (374), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-14 03:28:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2024-11-14 03:28:44,224 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 102 [2024-11-14 03:28:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:44,224 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2024-11-14 03:28:44,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 03:28:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2024-11-14 03:28:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-14 03:28:44,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:44,226 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:28:44,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (34)] Ended with exit code 0 [2024-11-14 03:28:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:28:44,426 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:28:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1210816409, now seen corresponding path program 1 times [2024-11-14 03:28:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:28:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054288580] [2024-11-14 03:28:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:44,428 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 03:28:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:28:44,430 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:28:44,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (35)] Waiting until timeout for monitored process [2024-11-14 03:28:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:44,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:28:44,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:28:45,554 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 03:28:46,025 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 18 treesize of output 13 [2024-11-14 03:28:46,368 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 18 treesize of output 13 [2024-11-14 03:28:46,417 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:28:47,003 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 64 treesize of output 54 [2024-11-14 03:28:47,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:47,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 63 [2024-11-14 03:28:48,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:48,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 57 [2024-11-14 03:28:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:28:49,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:28:49,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_926))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) is different from false [2024-11-14 03:28:49,723 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_926))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) is different from false [2024-11-14 03:28:49,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (forall ((v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_926))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 .cse4))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse4) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))) is different from false [2024-11-14 03:28:49,958 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32))) (let ((.cse7 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|)) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse6 (select .cse7 .cse4)) (.cse3 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse7 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg .cse6) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) (or (forall ((v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse2 (store .cse5 |c_~#double_Array_0~0.base| v_ArrVal_926))) (let ((.cse1 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse1 .cse4))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_926) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#unsigned_char_Array_0~0.base|) .cse3))) .cse6) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))))))) is different from false [2024-11-14 03:28:50,198 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_924))) (let ((.cse8 (select .cse3 |c_~#signed_long_int_Array_0~0.base|)) (.cse7 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse2 (select .cse8 .cse7)) (.cse1 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|))) (let ((.cse0 (store .cse3 |c_~#signed_long_int_Array_0~0.base| (store .cse8 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg .cse2) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_924 .cse1)))))))) (or (not (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))) .cse2) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (bvslt (let ((.cse5 (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_926))) (let ((.cse4 (select .cse5 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse6 (select .cse4 .cse7))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse3 |c_~#double_Array_0~0.base| v_ArrVal_926) |c_~#signed_long_int_Array_0~0.base| (store .cse4 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#unsigned_char_Array_0~0.base|) .cse1))))) .cse6))) |c_~#unsigned_char_Array_0~0.base|) .cse1))) .cse6)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))))))) is different from false [2024-11-14 03:28:50,543 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:28:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054288580] [2024-11-14 03:28:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054288580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:28:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005715069] [2024-11-14 03:28:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:28:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:28:50,545 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:28:50,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-14 03:28:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:51,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:28:51,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:28:53,463 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 17 treesize of output 17 [2024-11-14 03:28:53,617 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 22 treesize of output 15 [2024-11-14 03:28:54,137 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 45 treesize of output 37 [2024-11-14 03:28:54,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2024-11-14 03:28:56,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:56,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 42 [2024-11-14 03:28:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:28:56,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:28:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2005715069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:28:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2024-11-14 03:28:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623903657] [2024-11-14 03:28:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:56,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:28:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:28:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:28:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=522, Unknown=5, NotChecked=250, Total=870 [2024-11-14 03:28:56,723 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:29:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:01,501 INFO L93 Difference]: Finished difference Result 678 states and 837 transitions. [2024-11-14 03:29:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:29:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-14 03:29:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:01,505 INFO L225 Difference]: With dead ends: 678 [2024-11-14 03:29:01,505 INFO L226 Difference]: Without dead ends: 461 [2024-11-14 03:29:01,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2024-11-14 03:29:01,506 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 246 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:01,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 376 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-14 03:29:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-14 03:29:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 351. [2024-11-14 03:29:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 311 states have (on average 1.2218649517684887) internal successors, (380), 312 states have internal predecessors, (380), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-14 03:29:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 432 transitions. [2024-11-14 03:29:01,584 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 432 transitions. Word has length 103 [2024-11-14 03:29:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 432 transitions. [2024-11-14 03:29:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:29:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 432 transitions. [2024-11-14 03:29:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-14 03:29:01,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:01,586 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:29:01,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (35)] Ended with exit code 0 [2024-11-14 03:29:01,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2024-11-14 03:29:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:29:01,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:29:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash -807835708, now seen corresponding path program 1 times [2024-11-14 03:29:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:29:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305045925] [2024-11-14 03:29:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:01,988 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 03:29:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:29:01,990 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:29:01,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (37)] Waiting until timeout for monitored process [2024-11-14 03:29:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:02,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:29:02,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:03,102 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 03:29:03,532 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 18 treesize of output 13 [2024-11-14 03:29:03,891 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 18 treesize of output 13 [2024-11-14 03:29:03,943 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:29:04,252 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 65 treesize of output 55 [2024-11-14 03:29:04,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:04,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 64 [2024-11-14 03:29:06,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:06,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 58 [2024-11-14 03:29:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:29:06,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:07,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse1)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_980 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse2 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_980))) (let ((.cse3 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse4 (select .cse3 .cse0))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse3 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse1)))) (_ bv2 32)) .cse4))) |c_~#unsigned_char_Array_0~0.base|) .cse1))) .cse4)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))))) is different from false [2024-11-14 03:29:08,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_978 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_978))) (let ((.cse8 (select .cse0 |c_~#signed_long_int_Array_0~0.base|)) (.cse5 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse7 (select .cse8 .cse5)) (.cse4 (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|))) (let ((.cse6 (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store .cse8 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg .cse7) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_978 .cse4)))))))) (or (not (bvslt (let ((.cse3 (store .cse6 |c_~#double_Array_0~0.base| v_ArrVal_980))) (let ((.cse1 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (select .cse1 .cse5))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_980) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse4))) .cse2)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse4))) .cse7) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))))) is different from false [2024-11-14 03:29:09,317 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:29:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305045925] [2024-11-14 03:29:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305045925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1356555895] [2024-11-14 03:29:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:09,317 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:29:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:29:09,319 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:29:09,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-14 03:29:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:10,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:29:10,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:12,374 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 17 treesize of output 17 [2024-11-14 03:29:12,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-11-14 03:29:13,083 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 58 [2024-11-14 03:29:13,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:13,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 74 [2024-11-14 03:29:15,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:15,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 47 [2024-11-14 03:29:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:29:15,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:29:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1356555895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:29:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:29:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2024-11-14 03:29:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192098110] [2024-11-14 03:29:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:29:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:29:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:29:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:29:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=553, Unknown=18, NotChecked=98, Total=756 [2024-11-14 03:29:15,475 INFO L87 Difference]: Start difference. First operand 351 states and 432 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:29:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:20,753 INFO L93 Difference]: Finished difference Result 621 states and 763 transitions. [2024-11-14 03:29:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:29:20,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-14 03:29:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:20,758 INFO L225 Difference]: With dead ends: 621 [2024-11-14 03:29:20,758 INFO L226 Difference]: Without dead ends: 398 [2024-11-14 03:29:20,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=146, Invalid=836, Unknown=18, NotChecked=122, Total=1122 [2024-11-14 03:29:20,761 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 241 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:20,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 361 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-14 03:29:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-14 03:29:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 357. [2024-11-14 03:29:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.2176656151419558) internal successors, (386), 318 states have internal predecessors, (386), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-14 03:29:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 438 transitions. [2024-11-14 03:29:20,831 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 438 transitions. Word has length 103 [2024-11-14 03:29:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:20,832 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 438 transitions. [2024-11-14 03:29:20,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:29:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 438 transitions. [2024-11-14 03:29:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-14 03:29:20,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:20,833 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:29:20,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (37)] Ended with exit code 0 [2024-11-14 03:29:21,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-11-14 03:29:21,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:29:21,234 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:29:21,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1505856574, now seen corresponding path program 1 times [2024-11-14 03:29:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:29:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250750010] [2024-11-14 03:29:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:21,236 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 03:29:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:29:21,238 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:29:21,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (39)] Waiting until timeout for monitored process [2024-11-14 03:29:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:21,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:29:21,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:22,616 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 03:29:23,124 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 18 treesize of output 13 [2024-11-14 03:29:23,592 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:29:23,738 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 44 treesize of output 38 [2024-11-14 03:29:23,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:23,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2024-11-14 03:29:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:29:23,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:24,471 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:29:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250750010] [2024-11-14 03:29:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250750010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1638950500] [2024-11-14 03:29:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:29:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:29:24,473 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:29:24,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-14 03:29:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:25,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:29:25,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:26,689 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 03:29:27,359 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 16 treesize of output 11 [2024-11-14 03:29:27,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-14 03:29:28,087 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 38 treesize of output 32 [2024-11-14 03:29:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:29:28,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:28,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_62| (_ BitVec 8)) (v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1055) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_62|)))) is different from false [2024-11-14 03:29:30,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem30#1_62| (_ BitVec 8)) (v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (let ((.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (select (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd (bvneg (select .cse0 .cse1)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd (_ bv1 32) |~#unsigned_char_Array_0~0.offset|)))))))) |c_~#double_Array_0~0.base| v_ArrVal_1055) |c_~#signed_long_int_Array_0~0.base|) .cse1)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_62|)))) is different from false [2024-11-14 03:29:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1638950500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151663621] [2024-11-14 03:29:30,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:30,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:29:30,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:29:30,655 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:29:30,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-14 03:29:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:30,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:29:30,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:31,826 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 19 treesize of output 1 [2024-11-14 03:29:32,196 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 18 treesize of output 13 [2024-11-14 03:29:32,829 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:29:32,951 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 44 treesize of output 38 [2024-11-14 03:29:33,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:33,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2024-11-14 03:29:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:29:33,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151663621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:34,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:29:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 19 [2024-11-14 03:29:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286174148] [2024-11-14 03:29:34,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:29:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:29:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:29:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:29:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=637, Unknown=11, NotChecked=106, Total=870 [2024-11-14 03:29:34,721 INFO L87 Difference]: Start difference. First operand 357 states and 438 transitions. Second operand has 20 states, 18 states have (on average 5.722222222222222) internal successors, (103), 19 states have internal predecessors, (103), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-14 03:29:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:39,548 INFO L93 Difference]: Finished difference Result 600 states and 728 transitions. [2024-11-14 03:29:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:29:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.722222222222222) internal successors, (103), 19 states have internal predecessors, (103), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 104 [2024-11-14 03:29:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:39,551 INFO L225 Difference]: With dead ends: 600 [2024-11-14 03:29:39,551 INFO L226 Difference]: Without dead ends: 345 [2024-11-14 03:29:39,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 374 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=208, Invalid=979, Unknown=11, NotChecked=134, Total=1332 [2024-11-14 03:29:39,553 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 159 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:39,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 444 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-14 03:29:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-14 03:29:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 329. [2024-11-14 03:29:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 289 states have (on average 1.166089965397924) internal successors, (337), 290 states have internal predecessors, (337), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-14 03:29:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 389 transitions. [2024-11-14 03:29:39,617 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 389 transitions. Word has length 104 [2024-11-14 03:29:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:39,617 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 389 transitions. [2024-11-14 03:29:39,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.722222222222222) internal successors, (103), 19 states have internal predecessors, (103), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-14 03:29:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 389 transitions. [2024-11-14 03:29:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-14 03:29:39,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:39,618 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:29:39,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (39)] Ended with exit code 0 [2024-11-14 03:29:39,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-14 03:29:40,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2024-11-14 03:29:40,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:29:40,220 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:29:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash -360211702, now seen corresponding path program 1 times [2024-11-14 03:29:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:29:40,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582013232] [2024-11-14 03:29:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:40,221 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 03:29:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:29:40,222 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:29:40,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (42)] Waiting until timeout for monitored process [2024-11-14 03:29:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:40,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:29:40,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:41,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-11-14 03:29:42,893 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 131 treesize of output 102 [2024-11-14 03:29:43,576 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 131 treesize of output 102 [2024-11-14 03:29:44,226 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 131 treesize of output 102 [2024-11-14 03:29:44,987 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 131 treesize of output 102 [2024-11-14 03:29:45,190 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 131 treesize of output 102 [2024-11-14 03:29:45,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:45,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 198 treesize of output 102 [2024-11-14 03:29:45,701 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 161 treesize of output 134 [2024-11-14 03:29:46,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:29:46,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 349 treesize of output 147 [2024-11-14 03:29:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-14 03:29:47,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:48,228 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1115) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 03:29:48,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_149| (_ BitVec 64)) (v_ArrVal_1115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_149|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_149|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1115) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_149|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:29:48,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_149| (_ BitVec 64)) (v_ArrVal_1115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1112) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_149|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_149|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1115) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_149|))))))) is different from false [2024-11-14 03:29:48,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_149| (_ BitVec 64)) (v_ArrVal_1115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1111))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1112) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_149|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_149|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1115) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_149|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 03:29:48,581 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:29:48,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582013232] [2024-11-14 03:29:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582013232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:48,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1426634446] [2024-11-14 03:29:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:29:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:29:48,584 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:29:48,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2024-11-14 03:29:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:50,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:29:50,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:51,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:29:53,928 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 113 treesize of output 82 [2024-11-14 03:29:54,794 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 113 treesize of output 82 [2024-11-14 03:29:55,643 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 113 treesize of output 82 [2024-11-14 03:29:56,572 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 113 treesize of output 82 [2024-11-14 03:29:56,892 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 113 treesize of output 82 [2024-11-14 03:29:57,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2024-11-14 03:29:57,757 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 174 treesize of output 127 [2024-11-14 03:29:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 142 [2024-11-14 03:29:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-14 03:29:59,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:30:00,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_154| (_ BitVec 64)) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_154|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_154|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_154|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_154|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_154|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1146) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:30:00,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_154| (_ BitVec 64)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1143) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_154|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_154|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1146) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_154|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_154|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_154|))))))) is different from false [2024-11-14 03:30:00,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_154| (_ BitVec 64)) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1142))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1143) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_154|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_154|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1146) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_154|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_154|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_154|)))))))) is different from false [2024-11-14 03:30:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1426634446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:30:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078686162] [2024-11-14 03:30:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:00,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:30:00,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:30:00,790 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:30:00,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-14 03:30:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:01,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:30:01,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:02,586 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 25 treesize of output 10 [2024-11-14 03:30:20,184 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 75 treesize of output 58 [2024-11-14 03:30:20,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 75 treesize of output 58 [2024-11-14 03:30:21,282 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 75 treesize of output 58 [2024-11-14 03:30:21,915 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 75 treesize of output 58 [2024-11-14 03:30:26,260 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 75 treesize of output 58 [2024-11-14 03:30:26,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:30:26,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 142 treesize of output 82 [2024-11-14 03:30:27,106 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 120 treesize of output 99 [2024-11-14 03:30:28,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:30:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 308 treesize of output 124 [2024-11-14 03:30:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-14 03:30:28,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:30:29,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_159| (_ BitVec 64)) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_159|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_159|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_159|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_159|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_159|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1146) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:30:30,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_159| (_ BitVec 64)) (v_ArrVal_1175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1175) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_159|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_159|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_159|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_159|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_159|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1146) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:30:30,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_159| (_ BitVec 64)) (v_ArrVal_1175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1174))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1175) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_159|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_159|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_159|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_159|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_159|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1146) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 03:30:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078686162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:30:30,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:30:30,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 31 [2024-11-14 03:30:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829854530] [2024-11-14 03:30:30,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:30:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:30:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:30:30,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:30:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1256, Unknown=44, NotChecked=810, Total=2256 [2024-11-14 03:30:30,223 INFO L87 Difference]: Start difference. First operand 329 states and 389 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 31 states have internal predecessors, (148), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-14 03:30:34,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:30:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:30:50,625 INFO L93 Difference]: Finished difference Result 648 states and 762 transitions. [2024-11-14 03:30:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 03:30:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 31 states have internal predecessors, (148), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 105 [2024-11-14 03:30:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:30:50,629 INFO L225 Difference]: With dead ends: 648 [2024-11-14 03:30:50,630 INFO L226 Difference]: Without dead ends: 646 [2024-11-14 03:30:50,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=413, Invalid=2553, Unknown=44, NotChecked=1150, Total=4160 [2024-11-14 03:30:50,632 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 847 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:30:50,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 653 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2024-11-14 03:30:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-14 03:30:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 485. [2024-11-14 03:30:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 429 states have (on average 1.1794871794871795) internal successors, (506), 429 states have internal predecessors, (506), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:30:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 578 transitions. [2024-11-14 03:30:50,724 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 578 transitions. Word has length 105 [2024-11-14 03:30:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:30:50,725 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 578 transitions. [2024-11-14 03:30:50,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 31 states have internal predecessors, (148), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-14 03:30:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 578 transitions. [2024-11-14 03:30:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 03:30:50,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:30:50,727 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:50,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (42)] Ended with exit code 0 [2024-11-14 03:30:50,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2024-11-14 03:30:51,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2024-11-14 03:30:51,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:30:51,328 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:30:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:30:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash 289002009, now seen corresponding path program 1 times [2024-11-14 03:30:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:30:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277683168] [2024-11-14 03:30:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:51,329 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 03:30:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:30:51,331 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:51,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (45)] Waiting until timeout for monitored process [2024-11-14 03:30:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:51,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:30:51,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:53,157 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 03:30:53,372 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 18 treesize of output 13 [2024-11-14 03:30:53,447 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 18 treesize of output 13 [2024-11-14 03:30:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:30:53,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:30:53,685 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:30:53,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277683168] [2024-11-14 03:30:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277683168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:30:53,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:30:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:30:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215749782] [2024-11-14 03:30:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:30:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:30:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:30:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:30:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:30:53,687 INFO L87 Difference]: Start difference. First operand 485 states and 578 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:30:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:30:55,345 INFO L93 Difference]: Finished difference Result 1038 states and 1251 transitions. [2024-11-14 03:30:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:30:55,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-14 03:30:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:30:55,349 INFO L225 Difference]: With dead ends: 1038 [2024-11-14 03:30:55,349 INFO L226 Difference]: Without dead ends: 735 [2024-11-14 03:30:55,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:30:55,350 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 102 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:30:55,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 339 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 03:30:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-14 03:30:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 715. [2024-11-14 03:30:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 659 states have (on average 1.1911987860394537) internal successors, (785), 659 states have internal predecessors, (785), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:30:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 857 transitions. [2024-11-14 03:30:55,431 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 857 transitions. Word has length 106 [2024-11-14 03:30:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:30:55,431 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 857 transitions. [2024-11-14 03:30:55,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:30:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 857 transitions. [2024-11-14 03:30:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 03:30:55,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:30:55,433 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:55,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (45)] Ended with exit code 0 [2024-11-14 03:30:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:55,634 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:30:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:30:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash -520344617, now seen corresponding path program 1 times [2024-11-14 03:30:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:30:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28000309] [2024-11-14 03:30:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:55,635 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 03:30:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:30:55,636 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:55,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (46)] Waiting until timeout for monitored process [2024-11-14 03:30:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:55,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:30:55,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:30:56,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:30:56,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:30:56,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28000309] [2024-11-14 03:30:56,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28000309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:30:56,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:30:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:30:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970524588] [2024-11-14 03:30:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:30:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:30:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:30:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:30:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:30:56,190 INFO L87 Difference]: Start difference. First operand 715 states and 857 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:30:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:30:57,061 INFO L93 Difference]: Finished difference Result 1413 states and 1688 transitions. [2024-11-14 03:30:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:30:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-14 03:30:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:30:57,066 INFO L225 Difference]: With dead ends: 1413 [2024-11-14 03:30:57,066 INFO L226 Difference]: Without dead ends: 950 [2024-11-14 03:30:57,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:30:57,068 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 29 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:30:57,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 315 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:30:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-14 03:30:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 866. [2024-11-14 03:30:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 810 states have (on average 1.1777777777777778) internal successors, (954), 810 states have internal predecessors, (954), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:30:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1026 transitions. [2024-11-14 03:30:57,154 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1026 transitions. Word has length 106 [2024-11-14 03:30:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:30:57,154 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1026 transitions. [2024-11-14 03:30:57,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:30:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1026 transitions. [2024-11-14 03:30:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 03:30:57,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:30:57,157 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:57,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (46)] Ended with exit code 0 [2024-11-14 03:30:57,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:57,357 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:30:57,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:30:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 351041623, now seen corresponding path program 1 times [2024-11-14 03:30:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:30:57,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950479146] [2024-11-14 03:30:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:57,359 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 03:30:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:30:57,362 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:57,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (47)] Waiting until timeout for monitored process [2024-11-14 03:30:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:57,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:30:57,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:30:57,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:30:57,710 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:30:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950479146] [2024-11-14 03:30:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950479146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:30:57,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:30:57,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:30:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973595117] [2024-11-14 03:30:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:30:57,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:30:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:30:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:30:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:30:57,712 INFO L87 Difference]: Start difference. First operand 866 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:30:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:30:57,853 INFO L93 Difference]: Finished difference Result 1454 states and 1727 transitions. [2024-11-14 03:30:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:30:57,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-14 03:30:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:30:57,857 INFO L225 Difference]: With dead ends: 1454 [2024-11-14 03:30:57,857 INFO L226 Difference]: Without dead ends: 784 [2024-11-14 03:30:57,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:30:57,859 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:30:57,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:30:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-14 03:30:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-14 03:30:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 728 states have (on average 1.164835164835165) internal successors, (848), 728 states have internal predecessors, (848), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:30:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 920 transitions. [2024-11-14 03:30:57,965 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 920 transitions. Word has length 106 [2024-11-14 03:30:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:30:57,966 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 920 transitions. [2024-11-14 03:30:57,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:30:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 920 transitions. [2024-11-14 03:30:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 03:30:57,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:30:57,970 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:57,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (47)] Forceful destruction successful, exit code 0 [2024-11-14 03:30:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:58,171 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:30:58,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:30:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -536149523, now seen corresponding path program 1 times [2024-11-14 03:30:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:30:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915799267] [2024-11-14 03:30:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:58,171 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 03:30:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:30:58,173 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:30:58,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (48)] Waiting until timeout for monitored process [2024-11-14 03:30:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:58,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 03:30:58,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:59,429 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 03:30:59,997 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 18 treesize of output 13 [2024-11-14 03:31:00,501 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-14 03:31:01,203 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 64 treesize of output 54 [2024-11-14 03:31:01,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:01,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 63 [2024-11-14 03:31:02,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:02,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 37 [2024-11-14 03:31:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-14 03:31:02,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:04,107 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1272))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) is different from false [2024-11-14 03:31:04,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1272))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 .cse4))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse4) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))) is different from false [2024-11-14 03:31:05,212 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:31:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915799267] [2024-11-14 03:31:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915799267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862590980] [2024-11-14 03:31:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:05,213 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:31:05,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:31:05,214 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:31:05,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2024-11-14 03:31:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:07,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:31:07,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:08,673 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 12 treesize of output 8 [2024-11-14 03:31:09,322 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 17 treesize of output 12 [2024-11-14 03:31:10,042 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 40 treesize of output 34 [2024-11-14 03:31:10,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2024-11-14 03:31:12,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:12,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 41 [2024-11-14 03:31:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-14 03:31:12,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:31:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1862590980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:31:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2024-11-14 03:31:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341722204] [2024-11-14 03:31:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:31:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:31:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:31:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=595, Unknown=19, NotChecked=102, Total=812 [2024-11-14 03:31:12,886 INFO L87 Difference]: Start difference. First operand 784 states and 920 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:31:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:17,964 INFO L93 Difference]: Finished difference Result 1509 states and 1780 transitions. [2024-11-14 03:31:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:31:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-14 03:31:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:17,967 INFO L225 Difference]: With dead ends: 1509 [2024-11-14 03:31:17,967 INFO L226 Difference]: Without dead ends: 979 [2024-11-14 03:31:17,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=143, Invalid=838, Unknown=19, NotChecked=122, Total=1122 [2024-11-14 03:31:17,969 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 219 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:17,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 372 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:31:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-14 03:31:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 818. [2024-11-14 03:31:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 762 states have (on average 1.1640419947506562) internal successors, (887), 762 states have internal predecessors, (887), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:31:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 959 transitions. [2024-11-14 03:31:18,064 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 959 transitions. Word has length 106 [2024-11-14 03:31:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:18,065 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 959 transitions. [2024-11-14 03:31:18,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 03:31:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 959 transitions. [2024-11-14 03:31:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-14 03:31:18,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:18,067 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:18,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2024-11-14 03:31:18,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (48)] Forceful destruction successful, exit code 0 [2024-11-14 03:31:18,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:18,468 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:31:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash 204383267, now seen corresponding path program 1 times [2024-11-14 03:31:18,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:31:18,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029780639] [2024-11-14 03:31:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:18,469 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 03:31:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:31:18,471 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:18,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (50)] Waiting until timeout for monitored process [2024-11-14 03:31:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:18,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:31:18,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:18,872 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 18 treesize of output 10 [2024-11-14 03:31:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:31:18,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:31:18,906 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:31:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029780639] [2024-11-14 03:31:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029780639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:18,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:18,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:31:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803076691] [2024-11-14 03:31:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:18,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:31:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:31:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:31:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:31:18,908 INFO L87 Difference]: Start difference. First operand 818 states and 959 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:31:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:19,911 INFO L93 Difference]: Finished difference Result 1356 states and 1605 transitions. [2024-11-14 03:31:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:31:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-14 03:31:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:19,916 INFO L225 Difference]: With dead ends: 1356 [2024-11-14 03:31:19,916 INFO L226 Difference]: Without dead ends: 821 [2024-11-14 03:31:19,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 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 03:31:19,919 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:19,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:31:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-14 03:31:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2024-11-14 03:31:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 765 states have (on average 1.166013071895425) internal successors, (892), 765 states have internal predecessors, (892), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:31:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 964 transitions. [2024-11-14 03:31:20,031 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 964 transitions. Word has length 107 [2024-11-14 03:31:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:20,032 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 964 transitions. [2024-11-14 03:31:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:31:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 964 transitions. [2024-11-14 03:31:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-14 03:31:20,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:20,034 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:20,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (50)] Forceful destruction successful, exit code 0 [2024-11-14 03:31:20,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:20,237 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:31:20,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729893, now seen corresponding path program 1 times [2024-11-14 03:31:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:31:20,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471030060] [2024-11-14 03:31:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:20,238 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 03:31:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:31:20,241 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:20,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (51)] Waiting until timeout for monitored process [2024-11-14 03:31:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:20,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 03:31:20,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:22,272 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 17 treesize of output 12 [2024-11-14 03:31:22,337 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 17 treesize of output 12 [2024-11-14 03:31:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:31:22,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:31:22,531 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:31:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471030060] [2024-11-14 03:31:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471030060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:31:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920910072] [2024-11-14 03:31:22,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:22,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:31:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:31:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:31:22,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:31:22,532 INFO L87 Difference]: Start difference. First operand 821 states and 964 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:31:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:23,718 INFO L93 Difference]: Finished difference Result 1591 states and 1876 transitions. [2024-11-14 03:31:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:31:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-14 03:31:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:23,721 INFO L225 Difference]: With dead ends: 1591 [2024-11-14 03:31:23,721 INFO L226 Difference]: Without dead ends: 1053 [2024-11-14 03:31:23,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:31:23,722 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 128 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:23,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 261 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:31:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-14 03:31:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1034. [2024-11-14 03:31:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 978 states have (on average 1.1595092024539877) internal successors, (1134), 978 states have internal predecessors, (1134), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:31:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1206 transitions. [2024-11-14 03:31:23,826 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1206 transitions. Word has length 107 [2024-11-14 03:31:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1206 transitions. [2024-11-14 03:31:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:31:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1206 transitions. [2024-11-14 03:31:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-14 03:31:23,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:23,831 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:23,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (51)] Ended with exit code 0 [2024-11-14 03:31:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:24,032 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:31:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1358009369, now seen corresponding path program 1 times [2024-11-14 03:31:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:31:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519569781] [2024-11-14 03:31:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:24,033 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 03:31:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:31:24,037 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:24,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (52)] Waiting until timeout for monitored process [2024-11-14 03:31:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:24,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:31:24,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:24,852 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 03:31:25,347 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 20 treesize of output 15 [2024-11-14 03:31:25,654 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 20 treesize of output 15 [2024-11-14 03:31:26,071 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 20 treesize of output 15 [2024-11-14 03:31:26,459 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 20 treesize of output 15 [2024-11-14 03:31:26,945 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 20 treesize of output 15 [2024-11-14 03:31:27,044 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 20 treesize of output 15 [2024-11-14 03:31:27,303 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 19 treesize of output 14 [2024-11-14 03:31:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-14 03:31:27,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:27,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1372)) (.cse1 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1373) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1))))))) is different from false [2024-11-14 03:31:27,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:31:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519569781] [2024-11-14 03:31:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519569781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [859549082] [2024-11-14 03:31:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:31:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:31:27,931 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:31:27,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2024-11-14 03:31:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:28,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:31:28,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:29,342 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 19 treesize of output 1 [2024-11-14 03:31:29,719 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 03:31:29,942 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 03:31:30,196 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 03:31:30,449 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 03:31:30,753 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 03:31:30,844 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 03:31:31,142 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 19 treesize of output 14 [2024-11-14 03:31:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:31:31,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:31:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [859549082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:31:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2024-11-14 03:31:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732385480] [2024-11-14 03:31:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:31,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:31:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:31:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:31:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=243, Unknown=16, NotChecked=34, Total=380 [2024-11-14 03:31:31,167 INFO L87 Difference]: Start difference. First operand 1034 states and 1206 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:31:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:32,632 INFO L93 Difference]: Finished difference Result 1704 states and 2005 transitions. [2024-11-14 03:31:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:31:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-14 03:31:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:32,635 INFO L225 Difference]: With dead ends: 1704 [2024-11-14 03:31:32,636 INFO L226 Difference]: Without dead ends: 993 [2024-11-14 03:31:32,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=349, Unknown=20, NotChecked=42, Total=552 [2024-11-14 03:31:32,637 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 167 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:32,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 260 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:31:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2024-11-14 03:31:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 962. [2024-11-14 03:31:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 906 states have (on average 1.1589403973509933) internal successors, (1050), 906 states have internal predecessors, (1050), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-14 03:31:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1122 transitions. [2024-11-14 03:31:32,733 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1122 transitions. Word has length 107 [2024-11-14 03:31:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:32,734 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1122 transitions. [2024-11-14 03:31:32,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:31:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1122 transitions. [2024-11-14 03:31:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-14 03:31:32,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:32,736 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:32,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (53)] Ended with exit code 0 [2024-11-14 03:31:32,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (52)] Ended with exit code 0 [2024-11-14 03:31:33,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:33,137 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:31:33,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -206716444, now seen corresponding path program 1 times [2024-11-14 03:31:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:31:33,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712730296] [2024-11-14 03:31:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:33,138 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 03:31:33,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:31:33,140 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:31:33,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (54)] Waiting until timeout for monitored process [2024-11-14 03:31:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:33,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:31:33,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:34,376 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 20 treesize of output 21 [2024-11-14 03:31:37,844 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 139 treesize of output 108 [2024-11-14 03:31:38,624 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 139 treesize of output 108 [2024-11-14 03:31:39,472 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 139 treesize of output 108 [2024-11-14 03:31:40,456 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 139 treesize of output 108 [2024-11-14 03:31:40,681 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 139 treesize of output 108 [2024-11-14 03:31:40,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:40,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 206 treesize of output 104 [2024-11-14 03:31:41,276 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 169 treesize of output 140 [2024-11-14 03:31:42,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:42,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 357 treesize of output 149 [2024-11-14 03:31:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-14 03:31:43,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:43,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1435) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 03:31:43,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_191| (_ BitVec 64)) (v_ArrVal_1435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_191|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_191|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1435) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_191|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_191|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_191|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:31:44,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_191| (_ BitVec 64)) (v_ArrVal_1435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1432) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_191|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_191|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1435) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_191|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_191|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_191|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 03:31:44,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1431 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_191| (_ BitVec 64)) (v_ArrVal_1435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1431))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1432) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_191|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_191|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1435) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_191|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_191|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_191|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 03:31:44,243 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:31:44,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712730296] [2024-11-14 03:31:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712730296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:44,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1398301659] [2024-11-14 03:31:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:44,244 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:31:44,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:31:44,246 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:31:44,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2024-11-14 03:31:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:45,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 03:31:45,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:48,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:31:55,764 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 111 treesize of output 80 [2024-11-14 03:31:56,527 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 111 treesize of output 80 [2024-11-14 03:31:57,311 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 111 treesize of output 80 [2024-11-14 03:31:58,200 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 111 treesize of output 80 [2024-11-14 03:31:58,552 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 111 treesize of output 80 [2024-11-14 03:31:58,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 98 [2024-11-14 03:31:59,218 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 145 treesize of output 116 [2024-11-14 03:32:00,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 149 [2024-11-14 03:32:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-14 03:32:00,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:32:00,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1469) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 03:32:00,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_196| (_ BitVec 64)) (v_ArrVal_1469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_196|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_196|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_196|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_196|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_196|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1469) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:32:01,051 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_196| (_ BitVec 64)) (v_ArrVal_1469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1465) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_196|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_196|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_196|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_196|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_196|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1469) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:32:01,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_196| (_ BitVec 64)) (v_ArrVal_1469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1464))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1465) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_196|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_196|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1469) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_196|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_196|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_196|)))))))) is different from false [2024-11-14 03:32:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1398301659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:32:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473066978] [2024-11-14 03:32:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:01,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:32:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:32:01,234 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:32:01,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-11-14 03:32:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:01,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:32:01,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:32:02,706 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 25 treesize of output 10 [2024-11-14 03:32:31,809 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 74 treesize of output 57 [2024-11-14 03:32:32,234 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 74 treesize of output 57 [2024-11-14 03:32:32,680 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 74 treesize of output 57 [2024-11-14 03:32:33,168 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 74 treesize of output 57 [2024-11-14 03:32:33,572 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 74 treesize of output 57 [2024-11-14 03:32:33,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:32:33,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 141 treesize of output 81 [2024-11-14 03:32:34,876 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 149 treesize of output 116 [2024-11-14 03:32:36,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:32:36,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 117 [2024-11-14 03:32:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-14 03:32:36,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:32:37,655 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_201| (_ BitVec 64)) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_201|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_201|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_201|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_201|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_201|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1502) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 03:32:37,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_201| (_ BitVec 64)) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1498) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_201|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_201|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1502) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_201|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_201|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_201|))))))) is different from false [2024-11-14 03:32:37,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1497 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_201| (_ BitVec 64)) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1497))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1498) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_201|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_201|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1502) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_201|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_201|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_201|)))))))) is different from false [2024-11-14 03:32:37,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473066978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:32:37,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:32:37,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2024-11-14 03:32:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590055405] [2024-11-14 03:32:37,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:32:37,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:32:37,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:32:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:32:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2081, Unknown=62, NotChecked=1144, Total=3540 [2024-11-14 03:32:37,949 INFO L87 Difference]: Start difference. First operand 962 states and 1122 transitions. Second operand has 43 states, 40 states have (on average 4.35) internal successors, (174), 40 states have internal predecessors, (174), 9 states have call successors, (33), 9 states have call predecessors, (33), 10 states have return successors, (33), 6 states have call predecessors, (33), 9 states have call successors, (33) [2024-11-14 03:32:40,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:41,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:43,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:45,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:47,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:53,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:55,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:57,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:59,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:01,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:07,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:09,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:12,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:18,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:20,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:21,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:23,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:25,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:27,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:29,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:31,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:33,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:35,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:38,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:40,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:42,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:44,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:46,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:52,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:54,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:56,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:58,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:01,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:04,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:06,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:08,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:10,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:12,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:14,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:16,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:19,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:21,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:23,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:25,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:27,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:52,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:53,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:34:55,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:35:05,975 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 03:35:08,134 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 03:35:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:08,660 INFO L93 Difference]: Finished difference Result 1259 states and 1455 transitions. [2024-11-14 03:35:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:35:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 4.35) internal successors, (174), 40 states have internal predecessors, (174), 9 states have call successors, (33), 9 states have call predecessors, (33), 10 states have return successors, (33), 6 states have call predecessors, (33), 9 states have call successors, (33) Word has length 107 [2024-11-14 03:35:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:08,664 INFO L225 Difference]: With dead ends: 1259 [2024-11-14 03:35:08,664 INFO L226 Difference]: Without dead ends: 1257 [2024-11-14 03:35:08,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 357 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=717, Invalid=4353, Unknown=86, NotChecked=1650, Total=6806 [2024-11-14 03:35:08,666 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 715 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 104 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:08,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1402 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2957 Invalid, 45 Unknown, 0 Unchecked, 119.2s Time] [2024-11-14 03:35:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-14 03:35:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 632. [2024-11-14 03:35:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 592 states have (on average 1.1537162162162162) internal successors, (683), 593 states have internal predecessors, (683), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-14 03:35:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 735 transitions. [2024-11-14 03:35:08,746 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 735 transitions. Word has length 107 [2024-11-14 03:35:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 735 transitions. [2024-11-14 03:35:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 4.35) internal successors, (174), 40 states have internal predecessors, (174), 9 states have call successors, (33), 9 states have call predecessors, (33), 10 states have return successors, (33), 6 states have call predecessors, (33), 9 states have call successors, (33) [2024-11-14 03:35:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 735 transitions. [2024-11-14 03:35:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 03:35:08,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:08,748 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:35:08,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (54)] Ended with exit code 0 [2024-11-14 03:35:08,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (55)] Ended with exit code 0 [2024-11-14 03:35:09,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2024-11-14 03:35:09,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:09,349 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:09,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2137848244, now seen corresponding path program 1 times [2024-11-14 03:35:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:35:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871404506] [2024-11-14 03:35:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:09,350 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 03:35:09,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:35:09,352 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 03:35:09,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88546b6a-7664-4be3-9c1d-054d34583c81/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 (57)] Waiting until timeout for monitored process [2024-11-14 03:35:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:09,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:35:09,915 INFO L278 TraceCheckSpWp]: Computing forward predicates...