./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.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_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/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 a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:22:20,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:22:20,985 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:22:20,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:22:20,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:22:21,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:22:21,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:22:21,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:22:21,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:22:21,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:22:21,038 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:22:21,038 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:22:21,038 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:22:21,038 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:22:21,038 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:22:21,040 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:22:21,040 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:22:21,040 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:22:21,040 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:22:21,040 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:22:21,040 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:22:21,040 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:22:21,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:22:21,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:22:21,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:22:21,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:22:21,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:22:21,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:22:21,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:22:21,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:22:21,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:22:21,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:22:21,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:22:21,043 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_62ee4076-3006-4afe-a811-d17a9f8863b9/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 -> a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 [2024-11-14 05:22:21,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:22:21,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:22:21,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:22:21,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:22:21,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:22:21,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i Unable to find full path for "g++" [2024-11-14 05:22:23,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:22:24,130 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:22:24,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2024-11-14 05:22:24,157 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data/da101d892/7adea616a44143cc8f1e3d6fa4332a93/FLAGad59a5f74 [2024-11-14 05:22:24,269 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data/da101d892/7adea616a44143cc8f1e3d6fa4332a93 [2024-11-14 05:22:24,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:22:24,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:22:24,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:22:24,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:22:24,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:22:24,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4100a08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24, skipping insertion in model container [2024-11-14 05:22:24,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:22:24,515 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_62ee4076-3006-4afe-a811-d17a9f8863b9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-11-14 05:22:24,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:22:24,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:22:24,657 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_62ee4076-3006-4afe-a811-d17a9f8863b9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-11-14 05:22:24,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:22:24,748 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:22:24,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24 WrapperNode [2024-11-14 05:22:24,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:22:24,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:22:24,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:22:24,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:22:24,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,857 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-11-14 05:22:24,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:22:24,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:22:24,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:22:24,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:22:24,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:22:24,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:22:24,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:22:24,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:22:24,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (1/1) ... [2024-11-14 05:22:24,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:22:24,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:25,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:22:25,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:22:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:22:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 05:22:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:22:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 05:22:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:22:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 05:22:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 05:22:25,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 05:22:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:22:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:22:25,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:22:25,263 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:22:25,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:22:26,065 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-14 05:22:26,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:22:26,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:22:26,893 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:22:26,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:26 BoogieIcfgContainer [2024-11-14 05:22:26,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:22:26,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:22:26,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:22:26,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:22:26,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:24" (1/3) ... [2024-11-14 05:22:26,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb54b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:26, skipping insertion in model container [2024-11-14 05:22:26,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:24" (2/3) ... [2024-11-14 05:22:26,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb54b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:26, skipping insertion in model container [2024-11-14 05:22:26,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:26" (3/3) ... [2024-11-14 05:22:26,908 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-70.i [2024-11-14 05:22:26,927 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:22:26,929 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-70.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 05:22:27,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:22:27,026 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;@6c01db56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:22:27,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:22:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 05:22:27,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:27,049 INFO L215 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:27,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:27,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 983371618, now seen corresponding path program 1 times [2024-11-14 05:22:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:27,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871880541] [2024-11-14 05:22:27,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:22:31,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 05:22:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:22:34,788 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 05:22:34,790 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 05:22:34,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 05:22:34,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:22:34,800 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 05:22:35,043 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:22:35,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:22:35 BoogieIcfgContainer [2024-11-14 05:22:35,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:22:35,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:22:35,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:22:35,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:22:35,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:26" (3/4) ... [2024-11-14 05:22:35,057 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 05:22:35,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:22:35,063 INFO L158 Benchmark]: Toolchain (without parser) took 10785.14ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 94.4MB in the beginning and 219.8MB in the end (delta: -125.4MB). Peak memory consumption was 154.1MB. Max. memory is 16.1GB. [2024-11-14 05:22:35,063 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 142.6MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:22:35,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.13ms. Allocated memory is still 117.4MB. Free memory was 94.4MB in the beginning and 79.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:22:35,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.84ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 75.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:22:35,064 INFO L158 Benchmark]: Boogie Preprocessor took 95.75ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:22:35,065 INFO L158 Benchmark]: RCFGBuilder took 1936.93ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 60.6MB in the end (delta: 12.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-11-14 05:22:35,065 INFO L158 Benchmark]: TraceAbstraction took 8151.99ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 60.0MB in the beginning and 219.9MB in the end (delta: -159.9MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2024-11-14 05:22:35,066 INFO L158 Benchmark]: Witness Printer took 6.70ms. Allocated memory is still 394.3MB. Free memory was 219.9MB in the beginning and 219.8MB in the end (delta: 52.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:22:35,072 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.44ms. Allocated memory is still 142.6MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.13ms. Allocated memory is still 117.4MB. Free memory was 94.4MB in the beginning and 79.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.84ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 75.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 95.75ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1936.93ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 60.6MB in the end (delta: 12.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8151.99ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 60.0MB in the beginning and 219.9MB in the end (delta: -159.9MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. * Witness Printer took 6.70ms. Allocated memory is still 394.3MB. Free memory was 219.9MB in the beginning and 219.8MB in the end (delta: 52.7kB). Peak memory consumption was 8.4MB. 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 shiftLeft at line 62, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_4 = 19138; [L27] unsigned short int* var_1_4_Pointer = &(var_1_4); [L28] signed char var_1_6 = 25; [L29] signed char* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = -50; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] double var_1_8 = 8.3; [L33] double* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 255.6; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] double var_1_10 = 10000000.375; [L37] double* var_1_10_Pointer = &(var_1_10); [L38] double var_1_11 = 0.0; [L39] double* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 255.375; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] unsigned char var_1_13 = 50; [L43] unsigned char* var_1_13_Pointer = &(var_1_13); [L44] unsigned char var_1_14 = 2; [L45] unsigned char* var_1_14_Pointer = &(var_1_14); [L46] signed char var_1_15 = 1; [L47] signed char* var_1_15_Pointer = &(var_1_15); [L48] signed char var_1_16 = 5; [L49] signed char* var_1_16_Pointer = &(var_1_16); [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_uchar() [L76] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] var_1_4 = __VERIFIER_nondet_ushort() [L79] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] var_1_9 = __VERIFIER_nondet_double() [L82] EXPR \read(var_1_9) [L82] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F [L82] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) [L82] EXPR \read(var_1_9) [L82] EXPR var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F [L82] EXPR \read(var_1_9) [L82] EXPR var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F [L82] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] var_1_10 = __VERIFIER_nondet_double() [L84] EXPR \read(var_1_10) [L84] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L84] EXPR \read(var_1_10) [L84] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L84] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_11) [L86] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F [L86] EXPR (var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) [L86] EXPR \read(var_1_11) [L86] EXPR var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F [L86] EXPR \read(var_1_11) [L86] EXPR var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F [L86] EXPR (var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] EXPR \read(var_1_12) [L88] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L88] EXPR \read(var_1_12) [L88] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L88] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] RET updateVariables() [L108] CALL step() [L53] EXPR \read(*var_1_14_Pointer) [L53] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L54] EXPR \read(*var_1_16_Pointer) [L54] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L55] EXPR \read(*var_1_2_Pointer) [L55] COND TRUE (*(var_1_2_Pointer)) [L56] EXPR \read(*var_1_13_Pointer) [L56] EXPR \read(*var_1_4_Pointer) [L56] EXPR ((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))) [L56] EXPR \read(*var_1_13_Pointer) [L56] (*(var_1_1_Pointer)) = ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))) [L58] EXPR \read(*var_1_2_Pointer) [L58] (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) [L58] EXPR \read(*var_1_4_Pointer) [L58] EXPR \read(*var_1_13_Pointer) [L58] EXPR \read(*var_1_1_Pointer) [L58] (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) [L58] COND FALSE !((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) [L61] EXPR \read(*var_1_4_Pointer) [L61] unsigned short int stepLocal_0 = (*(var_1_4_Pointer)); [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) [L62] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) [L62] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) [L62] COND FALSE !(stepLocal_0 <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) [L65] EXPR \read(*var_1_13_Pointer) [L65] EXPR \read(*var_1_1_Pointer) [L65] EXPR \read(*var_1_4_Pointer) [L65] (*(var_1_7_Pointer)) = ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))) [L67] EXPR \read(*var_1_13_Pointer) [L67] unsigned char stepLocal_1 = (*(var_1_13_Pointer)); [L68] EXPR \read(*var_1_13_Pointer) [L68] COND FALSE !((*(var_1_13_Pointer)) < stepLocal_1) [L71] EXPR \read(*var_1_11_Pointer) [L71] EXPR \read(*var_1_12_Pointer) [L71] EXPR \read(*var_1_9_Pointer) [L71] (*(var_1_8_Pointer)) = (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*var_1_2_Pointer) [L99] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1 [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR ((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1 [L99] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1) [L99] EXPR \read(*var_1_2_Pointer) [L99] EXPR (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) [L99] EXPR ((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1 [L99] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1) [L99] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer))))))) [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) [L99] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) [L99] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) [L99] EXPR ((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR ((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR ((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))) [L99] EXPR ((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))) [L99] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer))))))) [L99] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer)))))) [L99] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) [L99] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) [L99-L100] return ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 1, TraceHistogramMax: 12, 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=33occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 05:22:35,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/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 a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:22:38,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:22:38,688 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 05:22:38,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:22:38,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:22:38,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:22:38,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:22:38,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:22:38,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:22:38,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:22:38,756 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:22:38,756 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:22:38,756 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:22:38,757 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:22:38,757 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:22:38,757 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:22:38,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:22:38,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:22:38,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:22:38,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:22:38,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:22:38,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:22:38,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:22:38,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:22:38,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:22:38,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:22:38,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:22:38,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:22:38,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:22:38,762 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:22:38,762 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:22:38,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:22:38,762 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:22:38,762 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_62ee4076-3006-4afe-a811-d17a9f8863b9/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 -> a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 [2024-11-14 05:22:39,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:22:39,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:22:39,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:22:39,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:22:39,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:22:39,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i Unable to find full path for "g++" [2024-11-14 05:22:41,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:22:42,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:22:42,061 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2024-11-14 05:22:42,073 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data/69e722741/464efe82389848e2bfeeadac88462a11/FLAG046452926 [2024-11-14 05:22:42,097 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/data/69e722741/464efe82389848e2bfeeadac88462a11 [2024-11-14 05:22:42,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:22:42,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:22:42,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:22:42,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:22:42,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:22:42,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d26a1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42, skipping insertion in model container [2024-11-14 05:22:42,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:22:42,336 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_62ee4076-3006-4afe-a811-d17a9f8863b9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-11-14 05:22:42,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:22:42,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:22:42,459 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_62ee4076-3006-4afe-a811-d17a9f8863b9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-11-14 05:22:42,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:22:42,519 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:22:42,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42 WrapperNode [2024-11-14 05:22:42,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:22:42,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:22:42,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:22:42,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:22:42,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,583 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-14 05:22:42,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:22:42,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:22:42,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:22:42,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:22:42,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:22:42,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:22:42,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:22:42,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:22:42,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (1/1) ... [2024-11-14 05:22:42,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:22:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:42,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:22:42,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:22:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:22:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 05:22:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 05:22:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 05:22:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 05:22:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:22:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 05:22:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 05:22:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:22:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 05:22:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 05:22:42,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 05:22:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:22:42,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:22:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 05:22:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 05:22:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:22:42,931 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:22:42,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:22:44,827 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-14 05:22:44,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:22:44,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:22:44,849 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:22:44,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:44 BoogieIcfgContainer [2024-11-14 05:22:44,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:22:44,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:22:44,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:22:44,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:22:44,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:42" (1/3) ... [2024-11-14 05:22:44,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae1871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:44, skipping insertion in model container [2024-11-14 05:22:44,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:42" (2/3) ... [2024-11-14 05:22:44,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae1871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:44, skipping insertion in model container [2024-11-14 05:22:44,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:44" (3/3) ... [2024-11-14 05:22:44,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-70.i [2024-11-14 05:22:44,886 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:22:44,889 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-70.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 05:22:44,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:22:44,989 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;@1e271a60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:22:44,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:22:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 05:22:45,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:45,015 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:45,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1015447861, now seen corresponding path program 1 times [2024-11-14 05:22:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849783674] [2024-11-14 05:22:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:45,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:45,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:45,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:45,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:45,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:22:45,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-14 05:22:45,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:45,708 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849783674] [2024-11-14 05:22:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849783674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:45,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:22:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869089243] [2024-11-14 05:22:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:22:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:22:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:22:45,749 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:22:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:45,783 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-14 05:22:45,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:22:45,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-14 05:22:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:45,793 INFO L225 Difference]: With dead ends: 195 [2024-11-14 05:22:45,793 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 05:22:45,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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 05:22:45,801 INFO L432 NwaCegarLoop]: 141 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, 141 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 05:22:45,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:22:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 05:22:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-14 05:22:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-14 05:22:45,866 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2024-11-14 05:22:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:45,867 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-14 05:22:45,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:22:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-14 05:22:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 05:22:45,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:45,873 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:45,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:46,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1553236539, now seen corresponding path program 1 times [2024-11-14 05:22:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:46,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631975450] [2024-11-14 05:22:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:46,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:46,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:46,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:46,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:22:46,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:22:46,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:46,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:46,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631975450] [2024-11-14 05:22:46,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631975450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:46,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:46,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:22:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174002956] [2024-11-14 05:22:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:22:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:22:46,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:22:46,786 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:48,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:22:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:50,481 INFO L93 Difference]: Finished difference Result 202 states and 296 transitions. [2024-11-14 05:22:50,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:22:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-14 05:22:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:50,485 INFO L225 Difference]: With dead ends: 202 [2024-11-14 05:22:50,485 INFO L226 Difference]: Without dead ends: 108 [2024-11-14 05:22:50,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 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 05:22:50,487 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 13 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:50,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 402 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 05:22:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-14 05:22:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-11-14 05:22:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2024-11-14 05:22:50,500 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 115 [2024-11-14 05:22:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:50,502 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2024-11-14 05:22:50,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2024-11-14 05:22:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 05:22:50,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:50,505 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:50,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:22:50,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:50,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:50,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash -33347077, now seen corresponding path program 1 times [2024-11-14 05:22:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:50,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599565477] [2024-11-14 05:22:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:50,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:50,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:51,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:22:51,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:51,339 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 17 treesize of output 9 [2024-11-14 05:22:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:22:51,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:51,387 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599565477] [2024-11-14 05:22:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599565477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:22:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646878964] [2024-11-14 05:22:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:51,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:22:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:22:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:22:51,390 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:52,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:22:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:52,967 INFO L93 Difference]: Finished difference Result 197 states and 285 transitions. [2024-11-14 05:22:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:22:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-14 05:22:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:52,970 INFO L225 Difference]: With dead ends: 197 [2024-11-14 05:22:52,970 INFO L226 Difference]: Without dead ends: 100 [2024-11-14 05:22:52,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 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 05:22:52,976 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:52,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:22:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-14 05:22:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-14 05:22:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-11-14 05:22:52,998 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 115 [2024-11-14 05:22:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:52,999 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-11-14 05:22:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-11-14 05:22:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 05:22:53,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:53,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:53,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:53,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:53,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1621694979, now seen corresponding path program 1 times [2024-11-14 05:22:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554550602] [2024-11-14 05:22:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:53,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:53,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:22:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:53,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:22:53,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:22:53,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:53,808 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554550602] [2024-11-14 05:22:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554550602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:22:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156858980] [2024-11-14 05:22:53,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:53,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:22:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:22:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:22:53,813 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:53,876 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2024-11-14 05:22:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:22:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-14 05:22:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:53,880 INFO L225 Difference]: With dead ends: 199 [2024-11-14 05:22:53,880 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 05:22:53,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:22:53,882 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:53,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:22:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 05:22:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-14 05:22:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-14 05:22:53,905 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 115 [2024-11-14 05:22:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:53,906 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-14 05:22:53,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-14 05:22:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 05:22:53,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:53,912 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:53,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 05:22:54,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:54,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 827847032, now seen corresponding path program 1 times [2024-11-14 05:22:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065047435] [2024-11-14 05:22:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:54,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:54,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 05:22:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:54,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:22:54,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:22:54,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:54,755 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:54,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065047435] [2024-11-14 05:22:54,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065047435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:54,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:54,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:22:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104405919] [2024-11-14 05:22:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:54,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:22:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:22:54,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:22:54,757 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:54,908 INFO L93 Difference]: Finished difference Result 208 states and 297 transitions. [2024-11-14 05:22:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:22:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-14 05:22:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:54,910 INFO L225 Difference]: With dead ends: 208 [2024-11-14 05:22:54,910 INFO L226 Difference]: Without dead ends: 109 [2024-11-14 05:22:54,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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 05:22:54,912 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:54,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:22:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-14 05:22:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-14 05:22:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2024-11-14 05:22:54,922 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 117 [2024-11-14 05:22:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:54,923 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2024-11-14 05:22:54,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2024-11-14 05:22:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 05:22:54,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:54,925 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:54,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 05:22:55,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:55,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:55,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1692112902, now seen corresponding path program 1 times [2024-11-14 05:22:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005806875] [2024-11-14 05:22:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:55,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:55,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:55,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:55,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:22:55,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:22:56,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:56,017 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005806875] [2024-11-14 05:22:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005806875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:56,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:22:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426429408] [2024-11-14 05:22:56,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:22:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:22:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:22:56,022 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:56,240 INFO L93 Difference]: Finished difference Result 216 states and 303 transitions. [2024-11-14 05:22:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:22:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-14 05:22:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:56,243 INFO L225 Difference]: With dead ends: 216 [2024-11-14 05:22:56,243 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 05:22:56,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:22:56,246 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:56,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 766 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:22:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 05:22:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-14 05:22:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:22:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-11-14 05:22:56,279 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 117 [2024-11-14 05:22:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:56,280 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-11-14 05:22:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:22:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-11-14 05:22:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 05:22:56,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:56,285 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:56,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:56,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:56,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:22:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1690265860, now seen corresponding path program 1 times [2024-11-14 05:22:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044465865] [2024-11-14 05:22:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:56,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:56,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:22:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:57,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:22:57,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:57,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:57,435 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 155 treesize of output 65 [2024-11-14 05:22:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-14 05:22:57,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:22:57,497 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044465865] [2024-11-14 05:22:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044465865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:22:57,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:22:57,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:22:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518468489] [2024-11-14 05:22:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:22:57,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:22:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:57,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:22:57,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:22:57,499 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:22:59,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:01,611 INFO L93 Difference]: Finished difference Result 218 states and 304 transitions. [2024-11-14 05:23:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:23:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-14 05:23:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:01,613 INFO L225 Difference]: With dead ends: 218 [2024-11-14 05:23:01,614 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 05:23:01,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:23:01,615 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:01,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 401 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-14 05:23:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 05:23:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-14 05:23:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-11-14 05:23:01,625 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 117 [2024-11-14 05:23:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:01,626 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-11-14 05:23:01,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-11-14 05:23:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-14 05:23:01,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:01,628 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:01,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:23:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:01,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1350525398, now seen corresponding path program 1 times [2024-11-14 05:23:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850053962] [2024-11-14 05:23:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:01,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:01,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:01,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 05:23:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:02,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:23:02,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:02,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:02,725 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 155 treesize of output 65 [2024-11-14 05:23:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 05:23:02,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:02,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850053962] [2024-11-14 05:23:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850053962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:23:02,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:23:02,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522876057] [2024-11-14 05:23:02,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:02,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:23:02,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:02,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:23:02,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:23:02,784 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:06,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:06,892 INFO L93 Difference]: Finished difference Result 218 states and 302 transitions. [2024-11-14 05:23:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:23:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-14 05:23:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:06,895 INFO L225 Difference]: With dead ends: 218 [2024-11-14 05:23:06,895 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 05:23:06,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:23:06,896 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:06,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 397 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-14 05:23:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 05:23:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-14 05:23:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2024-11-14 05:23:06,905 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 119 [2024-11-14 05:23:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:06,905 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2024-11-14 05:23:06,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2024-11-14 05:23:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 05:23:06,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:06,908 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:06,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 05:23:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:07,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:07,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 15076156, now seen corresponding path program 1 times [2024-11-14 05:23:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:07,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998136759] [2024-11-14 05:23:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:07,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:07,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:07,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:07,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 05:23:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:07,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:23:07,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:08,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:08,176 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 157 treesize of output 67 [2024-11-14 05:23:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-14 05:23:08,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:08,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998136759] [2024-11-14 05:23:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998136759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:08,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:23:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:23:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165934414] [2024-11-14 05:23:08,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:08,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:23:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:23:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:23:08,245 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:10,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:12,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:12,723 INFO L93 Difference]: Finished difference Result 218 states and 300 transitions. [2024-11-14 05:23:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:23:12,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-14 05:23:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:12,725 INFO L225 Difference]: With dead ends: 218 [2024-11-14 05:23:12,725 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 05:23:12,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:23:12,727 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 102 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:12,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 393 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-14 05:23:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 05:23:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-14 05:23:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2024-11-14 05:23:12,745 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 121 [2024-11-14 05:23:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:12,745 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2024-11-14 05:23:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-14 05:23:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 05:23:12,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:12,751 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:12,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Forceful destruction successful, exit code 0 [2024-11-14 05:23:12,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:12,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:12,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1242432490, now seen corresponding path program 1 times [2024-11-14 05:23:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:12,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485396753] [2024-11-14 05:23:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:12,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:12,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:12,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:12,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:23:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:13,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:23:13,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:13,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:13,924 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 155 treesize of output 65 [2024-11-14 05:23:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-14 05:23:13,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:13,985 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485396753] [2024-11-14 05:23:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485396753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:13,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:23:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:23:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727859254] [2024-11-14 05:23:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:13,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:23:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:23:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:23:13,988 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:16,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:19,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:19,179 INFO L93 Difference]: Finished difference Result 218 states and 298 transitions. [2024-11-14 05:23:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:23:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-14 05:23:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:19,180 INFO L225 Difference]: With dead ends: 218 [2024-11-14 05:23:19,181 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 05:23:19,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:23:19,182 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:19,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 387 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-14 05:23:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 05:23:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-14 05:23:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-14 05:23:19,198 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 123 [2024-11-14 05:23:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:19,199 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-14 05:23:19,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:23:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-14 05:23:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 05:23:19,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:19,201 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:19,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:23:19,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:19,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:19,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1994442298, now seen corresponding path program 1 times [2024-11-14 05:23:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575158873] [2024-11-14 05:23:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:19,414 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:19,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:23:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:20,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:23:20,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-14 05:23:20,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:20,132 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575158873] [2024-11-14 05:23:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575158873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:23:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:23:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532075431] [2024-11-14 05:23:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:20,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:23:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:23:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:23:20,136 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-14 05:23:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:20,489 INFO L93 Difference]: Finished difference Result 221 states and 300 transitions. [2024-11-14 05:23:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:23:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2024-11-14 05:23:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:20,492 INFO L225 Difference]: With dead ends: 221 [2024-11-14 05:23:20,492 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 05:23:20,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 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 05:23:20,494 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:20,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 569 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:23:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 05:23:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-14 05:23:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2024-11-14 05:23:20,503 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 125 [2024-11-14 05:23:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:20,503 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2024-11-14 05:23:20,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-14 05:23:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-11-14 05:23:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 05:23:20,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:20,506 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:20,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:23:20,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:20,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:20,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1792618364, now seen corresponding path program 1 times [2024-11-14 05:23:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930520814] [2024-11-14 05:23:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:20,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:20,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:20,718 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:20,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 05:23:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:21,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:23:21,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:24,618 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 05:23:25,846 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 05:23:26,802 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 05:23:27,635 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 05:23:28,335 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 05:23:29,039 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 05:23:29,710 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 05:23:30,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:23:30,644 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 05:23:30,786 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 05:23:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:30,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:31,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_362) c_~var_1_8_Pointer~0.base v_ArrVal_363) c_~var_1_2_Pointer~0.base) c_~var_1_2_Pointer~0.offset)))) is different from false [2024-11-14 05:23:31,599 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930520814] [2024-11-14 05:23:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930520814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [228032972] [2024-11-14 05:23:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:31,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:23:31,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:23:31,602 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:23:31,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 05:23:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:33,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:23:33,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:33,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 12 treesize of output 8 [2024-11-14 05:23:35,252 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 05:23:36,424 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 05:23:37,358 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 05:23:38,473 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 05:23:39,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 17 treesize of output 12 [2024-11-14 05:23:40,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:23:40,999 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 05:23:41,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2024-11-14 05:23:42,225 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 25 treesize of output 18 [2024-11-14 05:23:42,404 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 25 treesize of output 18 [2024-11-14 05:23:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:23:42,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:42,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_404) c_~var_1_2_Pointer~0.base) c_~var_1_2_Pointer~0.offset)))) is different from false [2024-11-14 05:23:42,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_403) c_~var_1_8_Pointer~0.base v_ArrVal_404) c_~var_1_2_Pointer~0.base) c_~var_1_2_Pointer~0.offset)))) is different from false [2024-11-14 05:23:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [228032972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:43,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294081195] [2024-11-14 05:23:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:43,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:43,144 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:43,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:23:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:45,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:23:45,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:46,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 17 treesize of output 12 [2024-11-14 05:23:46,929 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 05:23:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:23:46,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:46,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294081195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:46,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:23:46,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19, 15] total 34 [2024-11-14 05:23:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367392650] [2024-11-14 05:23:46,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:46,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:23:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:23:46,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1307, Unknown=79, NotChecked=240, Total=1892 [2024-11-14 05:23:46,948 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:23:48,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:50,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:52,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:52,776 INFO L93 Difference]: Finished difference Result 261 states and 351 transitions. [2024-11-14 05:23:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:23:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-14 05:23:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:52,779 INFO L225 Difference]: With dead ends: 261 [2024-11-14 05:23:52,779 INFO L226 Difference]: Without dead ends: 154 [2024-11-14 05:23:52,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=279, Invalid=1375, Unknown=80, NotChecked=246, Total=1980 [2024-11-14 05:23:52,781 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:52,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 298 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-14 05:23:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-14 05:23:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2024-11-14 05:23:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-14 05:23:52,791 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 125 [2024-11-14 05:23:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:52,791 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-14 05:23:52,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:23:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-14 05:23:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 05:23:52,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:52,793 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:52,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 05:23:53,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-14 05:23:53,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 05:23:53,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:53,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:53,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1616186718, now seen corresponding path program 1 times [2024-11-14 05:23:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787674450] [2024-11-14 05:23:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:53,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:53,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:53,397 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:53,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 05:23:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:53,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:23:53,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:23:53,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:53,941 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:53,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787674450] [2024-11-14 05:23:53,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787674450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:53,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:23:53,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:23:53,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888704738] [2024-11-14 05:23:53,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:53,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:23:53,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:53,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:23:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:23:53,943 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:23:56,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:23:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:57,690 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2024-11-14 05:23:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:23:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-14 05:23:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:57,693 INFO L225 Difference]: With dead ends: 270 [2024-11-14 05:23:57,693 INFO L226 Difference]: Without dead ends: 153 [2024-11-14 05:23:57,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:23:57,694 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 37 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:57,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 369 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-14 05:23:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-14 05:23:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2024-11-14 05:23:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2024-11-14 05:23:57,708 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 126 [2024-11-14 05:23:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:57,709 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2024-11-14 05:23:57,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:23:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2024-11-14 05:23:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 05:23:57,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:57,710 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:57,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:23:57,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:57,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:57,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash 387799650, now seen corresponding path program 1 times [2024-11-14 05:23:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384476962] [2024-11-14 05:23:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:57,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:57,913 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:57,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:23:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:58,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:23:58,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:23:58,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:23:58,419 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:23:58,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384476962] [2024-11-14 05:23:58,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384476962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:23:58,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:23:58,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:23:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978368955] [2024-11-14 05:23:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:23:58,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:23:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:23:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:23:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:23:58,420 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:23:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:58,476 INFO L93 Difference]: Finished difference Result 244 states and 327 transitions. [2024-11-14 05:23:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:23:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-14 05:23:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:58,478 INFO L225 Difference]: With dead ends: 244 [2024-11-14 05:23:58,478 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 05:23:58,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:23:58,479 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:58,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:23:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 05:23:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-14 05:23:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 111 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:23:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2024-11-14 05:23:58,488 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 126 [2024-11-14 05:23:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2024-11-14 05:23:58,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:23:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2024-11-14 05:23:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:23:58,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:58,490 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:58,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:23:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:58,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:23:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 523170103, now seen corresponding path program 1 times [2024-11-14 05:23:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:23:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216892625] [2024-11-14 05:23:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:58,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:23:58,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:23:58,693 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:23:58,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:23:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:59,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:23:59,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:00,986 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 05:24:02,312 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 05:24:03,171 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 05:24:03,817 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 05:24:04,405 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 05:24:04,942 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 05:24:05,375 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 05:24:05,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:24:06,066 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 34 treesize of output 36 [2024-11-14 05:24:06,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-11-14 05:24:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:24:06,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:08,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem12#1_16| (_ BitVec 8)) (v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_535) c_~var_1_15_Pointer~0.base v_ArrVal_534))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~var_1_1_Pointer~0.base (store (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset .cse1)) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_16|) ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))))) is different from false [2024-11-14 05:24:08,346 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:24:08,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216892625] [2024-11-14 05:24:08,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216892625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:08,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701702648] [2024-11-14 05:24:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:24:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:24:08,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:24:08,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-14 05:24:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:10,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:24:10,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:13,865 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:24:13,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:24:13,929 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:24:13,929 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 33 treesize of output 35 [2024-11-14 05:24:13,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:24:14,530 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 34 treesize of output 29 [2024-11-14 05:24:14,905 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 34 [2024-11-14 05:24:15,781 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 81 treesize of output 67 [2024-11-14 05:24:16,112 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 81 treesize of output 67 [2024-11-14 05:24:17,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 79 [2024-11-14 05:24:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:24:17,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:24:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [701702648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:24:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:24:17,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2024-11-14 05:24:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831233560] [2024-11-14 05:24:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:24:17,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:24:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:24:17,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:24:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1193, Unknown=1, NotChecked=70, Total=1406 [2024-11-14 05:24:17,337 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:24:31,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:24:33,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:24:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:35,318 INFO L93 Difference]: Finished difference Result 363 states and 477 transitions. [2024-11-14 05:24:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:24:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:24:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:35,321 INFO L225 Difference]: With dead ends: 363 [2024-11-14 05:24:35,321 INFO L226 Difference]: Without dead ends: 241 [2024-11-14 05:24:35,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=281, Invalid=2374, Unknown=1, NotChecked=100, Total=2756 [2024-11-14 05:24:35,323 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 338 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:35,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 897 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2024-11-14 05:24:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-14 05:24:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2024-11-14 05:24:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:24:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2024-11-14 05:24:35,337 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 127 [2024-11-14 05:24:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:35,337 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2024-11-14 05:24:35,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:24:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2024-11-14 05:24:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:24:35,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:35,339 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:35,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-14 05:24:35,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:24:35,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:24:35,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:24:35,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash -497898251, now seen corresponding path program 1 times [2024-11-14 05:24:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:24:35,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951631251] [2024-11-14 05:24:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:35,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:24:35,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:24:35,743 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:24:35,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:24:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:36,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:24:36,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:38,379 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 05:24:40,036 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 05:24:41,132 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 05:24:42,156 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 05:24:43,037 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 05:24:43,888 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 05:24:44,613 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 05:24:45,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:24:45,781 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 27 treesize of output 20 [2024-11-14 05:24:45,949 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 27 treesize of output 20 [2024-11-14 05:24:46,105 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 27 treesize of output 20 [2024-11-14 05:24:46,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 27 treesize of output 20 [2024-11-14 05:24:46,329 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 27 treesize of output 15 [2024-11-14 05:24:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:24:46,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:46,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_620) c_~var_1_8_Pointer~0.base v_ArrVal_621) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) is different from false [2024-11-14 05:24:46,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store |c_#memory_int| c_~var_1_6_Pointer~0.base v_ArrVal_619) c_~var_1_7_Pointer~0.base v_ArrVal_620) c_~var_1_8_Pointer~0.base v_ArrVal_621) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) is different from false [2024-11-14 05:24:46,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_618) c_~var_1_6_Pointer~0.base v_ArrVal_619) c_~var_1_7_Pointer~0.base v_ArrVal_620) c_~var_1_8_Pointer~0.base v_ArrVal_621) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) is different from false [2024-11-14 05:24:47,316 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:24:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951631251] [2024-11-14 05:24:47,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951631251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [850629859] [2024-11-14 05:24:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:24:47,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:24:47,319 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:24:47,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 05:24:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:48,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:24:48,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:51,275 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 05:24:51,419 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 05:24:51,558 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 05:24:51,703 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 05:24:51,816 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 05:24:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:24:53,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:24:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [850629859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:24:53,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:24:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 29 [2024-11-14 05:24:53,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37802892] [2024-11-14 05:24:53,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:24:53,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:24:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:24:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:24:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=950, Unknown=32, NotChecked=204, Total=1406 [2024-11-14 05:24:53,921 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:24:56,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:25:00,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:25:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:00,194 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2024-11-14 05:25:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:25:00,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:25:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:00,197 INFO L225 Difference]: With dead ends: 339 [2024-11-14 05:25:00,197 INFO L226 Difference]: Without dead ends: 197 [2024-11-14 05:25:00,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=234, Invalid=1006, Unknown=32, NotChecked=210, Total=1482 [2024-11-14 05:25:00,200 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 144 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:00,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 450 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 05:25:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-14 05:25:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 153. [2024-11-14 05:25:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:25:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2024-11-14 05:25:00,212 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 127 [2024-11-14 05:25:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:00,213 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2024-11-14 05:25:00,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:25:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2024-11-14 05:25:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:25:00,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:00,215 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:00,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-14 05:25:00,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:25:00,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:25:00,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:25:00,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash 304315385, now seen corresponding path program 1 times [2024-11-14 05:25:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:25:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353465164] [2024-11-14 05:25:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:00,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:25:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:25:00,620 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:25:00,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:25:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:01,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:25:01,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:02,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 8 treesize of output 1 [2024-11-14 05:25:03,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 18 treesize of output 13 [2024-11-14 05:25:04,505 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 05:25:05,130 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 05:25:05,666 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 05:25:06,141 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 05:25:06,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 18 treesize of output 13 [2024-11-14 05:25:06,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:25:07,188 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 34 treesize of output 36 [2024-11-14 05:25:07,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-11-14 05:25:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:25:07,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:08,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem12#1_27| (_ BitVec 8)) (v_ArrVal_699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_700) c_~var_1_15_Pointer~0.base v_ArrVal_699))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~var_1_1_Pointer~0.base (store (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset .cse1)) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) .cse1)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_27|))))))) is different from false [2024-11-14 05:25:08,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:25:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353465164] [2024-11-14 05:25:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353465164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291440047] [2024-11-14 05:25:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:08,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:25:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:25:08,377 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:25:08,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-14 05:25:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:10,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:25:10,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:13,495 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:25:13,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:25:13,541 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:25:13,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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-14 05:25:13,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:14,140 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 34 treesize of output 29 [2024-11-14 05:25:14,492 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 34 [2024-11-14 05:25:15,232 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 61 treesize of output 51 [2024-11-14 05:25:15,528 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 61 treesize of output 51 [2024-11-14 05:25:16,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 67 [2024-11-14 05:25:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:25:16,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:25:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1291440047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:16,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:25:16,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2024-11-14 05:25:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110692506] [2024-11-14 05:25:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:25:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:25:16,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:25:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1191, Unknown=1, NotChecked=70, Total=1406 [2024-11-14 05:25:16,584 INFO L87 Difference]: Start difference. First operand 153 states and 201 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:25:23,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:24,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:29,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:31,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:33,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:34,086 INFO L93 Difference]: Finished difference Result 396 states and 516 transitions. [2024-11-14 05:25:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:25:34,087 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:25:34,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:34,089 INFO L225 Difference]: With dead ends: 396 [2024-11-14 05:25:34,089 INFO L226 Difference]: Without dead ends: 246 [2024-11-14 05:25:34,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=279, Invalid=2274, Unknown=1, NotChecked=98, Total=2652 [2024-11-14 05:25:34,091 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 292 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:34,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 921 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2024-11-14 05:25:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-14 05:25:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 155. [2024-11-14 05:25:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 140 states have internal predecessors, (180), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:25:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 204 transitions. [2024-11-14 05:25:34,105 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 204 transitions. Word has length 127 [2024-11-14 05:25:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 204 transitions. [2024-11-14 05:25:34,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:25:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 204 transitions. [2024-11-14 05:25:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:25:34,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:34,108 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:34,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-14 05:25:34,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Forceful destruction successful, exit code 0 [2024-11-14 05:25:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:25:34,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:25:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 13697013, now seen corresponding path program 1 times [2024-11-14 05:25:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:25:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356633987] [2024-11-14 05:25:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:34,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:25:34,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:25:34,512 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:25:34,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:25:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:35,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:25:35,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:37,041 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 05:25:38,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 18 treesize of output 13 [2024-11-14 05:25:39,852 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 05:25:40,789 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 05:25:41,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 05:25:42,367 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 05:25:43,112 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 05:25:43,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:25:44,100 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 05:25:44,247 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 05:25:44,386 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 05:25:44,481 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 05:25:44,574 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 19 treesize of output 11 [2024-11-14 05:25:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:25:46,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:46,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_786) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))) is different from false [2024-11-14 05:25:48,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:25:48,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356633987] [2024-11-14 05:25:48,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356633987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:48,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1435864945] [2024-11-14 05:25:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:48,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:25:48,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:25:48,371 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:25:48,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-14 05:25:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:50,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:25:50,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:52,519 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 05:25:52,609 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 05:25:52,663 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 05:25:52,699 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 05:25:52,716 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 19 treesize of output 11 [2024-11-14 05:25:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:25:55,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:25:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1435864945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:55,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:25:55,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 24 [2024-11-14 05:25:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113750770] [2024-11-14 05:25:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:55,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:25:55,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:25:55,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:25:55,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=786, Unknown=33, NotChecked=60, Total=1056 [2024-11-14 05:25:55,073 INFO L87 Difference]: Start difference. First operand 155 states and 204 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:25:57,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:26:01,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:26:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:01,338 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2024-11-14 05:26:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:26:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:26:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:01,339 INFO L225 Difference]: With dead ends: 351 [2024-11-14 05:26:01,339 INFO L226 Difference]: Without dead ends: 199 [2024-11-14 05:26:01,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=195, Invalid=832, Unknown=33, NotChecked=62, Total=1122 [2024-11-14 05:26:01,340 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 177 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:01,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 443 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 05:26:01,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-14 05:26:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2024-11-14 05:26:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:26:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2024-11-14 05:26:01,353 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 127 [2024-11-14 05:26:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:01,353 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2024-11-14 05:26:01,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:26:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2024-11-14 05:26:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:26:01,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:01,355 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:01,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-14 05:26:01,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:26:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:26:01,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1007371341, now seen corresponding path program 1 times [2024-11-14 05:26:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:26:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655565116] [2024-11-14 05:26:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:01,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:26:01,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:26:01,758 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:26:01,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:26:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:02,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:26:02,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:03,873 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 05:26:05,684 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 27 treesize of output 20 [2024-11-14 05:26:06,487 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 27 treesize of output 20 [2024-11-14 05:26:07,205 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 27 treesize of output 20 [2024-11-14 05:26:07,872 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 27 treesize of output 20 [2024-11-14 05:26:08,543 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 27 treesize of output 20 [2024-11-14 05:26:09,054 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 27 treesize of output 20 [2024-11-14 05:26:09,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:26:09,918 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 51 treesize of output 45 [2024-11-14 05:26:10,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 54 [2024-11-14 05:26:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:26:10,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:11,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem12#1_38| (_ BitVec 8)) (v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_865) c_~var_1_15_Pointer~0.base v_ArrVal_864))) (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (or (not (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (_ bv17222 32) .cse2))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~var_1_1_Pointer~0.base (store (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset .cse1)) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) .cse1)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_38|))))) (bvslt (_ bv29916 32) .cse2))))) is different from false [2024-11-14 05:26:11,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:26:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655565116] [2024-11-14 05:26:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655565116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [360858066] [2024-11-14 05:26:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:26:11,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:26:11,529 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:26:11,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-14 05:26:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:13,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:26:13,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:15,558 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:26:15,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:26:15,622 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:26:15,622 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 33 treesize of output 35 [2024-11-14 05:26:16,242 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 51 treesize of output 45 [2024-11-14 05:26:16,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 56 [2024-11-14 05:26:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:26:16,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:26:16,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [360858066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:16,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:26:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 27 [2024-11-14 05:26:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121136579] [2024-11-14 05:26:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:16,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:26:16,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:26:16,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:26:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=830, Unknown=1, NotChecked=60, Total=1056 [2024-11-14 05:26:16,626 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:26:19,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:26:21,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:26:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:21,456 INFO L93 Difference]: Finished difference Result 317 states and 414 transitions. [2024-11-14 05:26:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:26:21,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:26:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:21,458 INFO L225 Difference]: With dead ends: 317 [2024-11-14 05:26:21,458 INFO L226 Difference]: Without dead ends: 165 [2024-11-14 05:26:21,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=215, Invalid=1194, Unknown=1, NotChecked=72, Total=1482 [2024-11-14 05:26:21,460 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 101 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:21,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 309 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-14 05:26:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-14 05:26:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 154. [2024-11-14 05:26:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 139 states have internal predecessors, (177), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:26:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2024-11-14 05:26:21,475 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 127 [2024-11-14 05:26:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:21,475 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2024-11-14 05:26:21,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:26:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2024-11-14 05:26:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:26:21,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:21,477 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:21,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:26:21,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-14 05:26:21,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:26:21,877 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:21,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1141384847, now seen corresponding path program 1 times [2024-11-14 05:26:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:26:21,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240908111] [2024-11-14 05:26:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:26:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:26:21,880 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:26:21,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:26:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:22,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 05:26:22,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:24,596 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 05:26:26,944 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 27 treesize of output 20 [2024-11-14 05:26:28,006 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 27 treesize of output 20 [2024-11-14 05:26:28,947 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 27 treesize of output 20 [2024-11-14 05:26:29,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 27 treesize of output 20 [2024-11-14 05:26:30,551 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 27 treesize of output 20 [2024-11-14 05:26:31,305 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 27 treesize of output 20 [2024-11-14 05:26:31,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:26:32,520 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 51 treesize of output 45 [2024-11-14 05:26:33,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 88 [2024-11-14 05:26:34,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 88 [2024-11-14 05:26:34,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 95 [2024-11-14 05:26:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:26:35,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:36,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_945))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))))))))) is different from false [2024-11-14 05:26:39,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_941) c_~var_1_15_Pointer~0.base v_ArrVal_942))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (let ((.cse4 (store .cse5 c_~var_1_1_Pointer~0.base (store (select .cse5 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) .cse0))))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (let ((.cse2 (bvshl .cse1 .cse1))) (or (bvslt (_ bv29916 32) .cse0) (bvsgt .cse1 .cse2) (let ((.cse3 (store (store .cse4 c_~var_1_7_Pointer~0.base v_ArrVal_944) c_~var_1_8_Pointer~0.base v_ArrVal_945))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) .cse2)))))))) is different from false [2024-11-14 05:26:40,180 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:26:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240908111] [2024-11-14 05:26:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240908111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [505985791] [2024-11-14 05:26:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:40,180 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:26:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:26:40,182 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:26:40,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 05:26:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:42,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:26:42,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:45,679 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:26:45,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:26:45,727 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:26:45,727 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 33 treesize of output 35 [2024-11-14 05:26:45,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:26:46,628 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 51 treesize of output 45 [2024-11-14 05:26:48,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2024-11-14 05:26:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2024-11-14 05:26:50,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 97 [2024-11-14 05:26:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:26:50,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:26:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [505985791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:50,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:26:50,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [29] total 40 [2024-11-14 05:26:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650262584] [2024-11-14 05:26:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:50,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:26:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:26:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:26:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2308, Unknown=10, NotChecked=198, Total=2756 [2024-11-14 05:26:50,982 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:26:59,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:27:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:08,332 INFO L93 Difference]: Finished difference Result 397 states and 515 transitions. [2024-11-14 05:27:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:27:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:27:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:08,334 INFO L225 Difference]: With dead ends: 397 [2024-11-14 05:27:08,334 INFO L226 Difference]: Without dead ends: 246 [2024-11-14 05:27:08,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=428, Invalid=3860, Unknown=10, NotChecked=258, Total=4556 [2024-11-14 05:27:08,336 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 290 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:08,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 899 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-14 05:27:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-14 05:27:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 160. [2024-11-14 05:27:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 145 states have internal predecessors, (185), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:27:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2024-11-14 05:27:08,348 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 127 [2024-11-14 05:27:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:08,349 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2024-11-14 05:27:08,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:27:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2024-11-14 05:27:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 05:27:08,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:08,350 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:08,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:27:08,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 05:27:08,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:27:08,751 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:27:08,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1360239565, now seen corresponding path program 1 times [2024-11-14 05:27:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:27:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039010327] [2024-11-14 05:27:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:08,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:27:08,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:27:08,753 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:27:08,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:27:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:09,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 05:27:09,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:11,224 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 05:27:12,119 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 05:27:12,821 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 05:27:13,475 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 05:27:14,073 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 05:27:14,534 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 05:27:14,966 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 05:27:15,389 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 13 treesize of output 1 [2024-11-14 05:27:15,638 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 34 [2024-11-14 05:27:15,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2024-11-14 05:27:16,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2024-11-14 05:27:16,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 60 [2024-11-14 05:27:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:27:16,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:17,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1024))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))))))) is different from false [2024-11-14 05:27:17,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1024 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) |c_ULTIMATE.start_step_#t~ite10#1| (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem7#1|)) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1023) c_~var_1_8_Pointer~0.base v_ArrVal_1024))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset)))) (_ bv2 32)) (_ bv17222 32)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))) is different from false [2024-11-14 05:27:17,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1024 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem7#1|)) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1023) c_~var_1_8_Pointer~0.base v_ArrVal_1024))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (_ bv17222 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset)))) (_ bv2 32)))))))) is different from false [2024-11-14 05:27:17,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1024 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32)) ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1023) c_~var_1_8_Pointer~0.base v_ArrVal_1024))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32)))))))) is different from false [2024-11-14 05:27:17,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store (let ((.cse1 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1020) c_~var_1_15_Pointer~0.base v_ArrVal_1021))) (store .cse1 c_~var_1_1_Pointer~0.base (store (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1023) c_~var_1_8_Pointer~0.base v_ArrVal_1024))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))) is different from false [2024-11-14 05:27:17,876 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:27:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039010327] [2024-11-14 05:27:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039010327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1861278057] [2024-11-14 05:27:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:27:17,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:27:17,878 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:27:17,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-14 05:27:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:20,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 05:27:20,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:23,301 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:27:23,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:27:23,345 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:27:23,345 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 33 treesize of output 35 [2024-11-14 05:27:23,958 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 51 treesize of output 45 [2024-11-14 05:27:25,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2024-11-14 05:27:25,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2024-11-14 05:27:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 84 [2024-11-14 05:27:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:27:26,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:27:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1861278057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:27:26,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:27:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 29 [2024-11-14 05:27:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495073126] [2024-11-14 05:27:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:27:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:27:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:27:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:27:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1022, Unknown=18, NotChecked=350, Total=1560 [2024-11-14 05:27:26,577 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:27:31,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:27:32,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:27:38,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:27:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:48,953 INFO L93 Difference]: Finished difference Result 413 states and 535 transitions. [2024-11-14 05:27:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:27:48,954 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-14 05:27:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:48,956 INFO L225 Difference]: With dead ends: 413 [2024-11-14 05:27:48,956 INFO L226 Difference]: Without dead ends: 256 [2024-11-14 05:27:48,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=361, Invalid=1988, Unknown=23, NotChecked=490, Total=2862 [2024-11-14 05:27:48,958 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 279 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:48,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1058 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2024-11-14 05:27:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-14 05:27:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 162. [2024-11-14 05:27:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:27:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2024-11-14 05:27:48,974 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 127 [2024-11-14 05:27:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:48,975 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2024-11-14 05:27:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:27:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2024-11-14 05:27:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:27:48,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:48,977 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:48,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:27:49,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-14 05:27:49,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:27:49,381 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:27:49,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1573402450, now seen corresponding path program 1 times [2024-11-14 05:27:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:27:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247829947] [2024-11-14 05:27:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:49,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:27:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:27:49,384 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:27:49,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:27:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:50,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:27:50,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:51,529 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 05:27:52,737 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 05:27:53,446 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 05:27:54,099 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 05:27:54,615 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 05:27:55,094 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 05:27:55,523 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 05:27:55,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:27:56,188 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 34 treesize of output 36 [2024-11-14 05:27:56,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-11-14 05:27:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:27:56,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:59,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem12#1_55| (_ BitVec 8)) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1102) c_~var_1_15_Pointer~0.base v_ArrVal_1101))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32))))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~var_1_1_Pointer~0.base (store (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset .cse1)) c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) .cse1)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_55|))))))) is different from false [2024-11-14 05:27:59,490 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:27:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247829947] [2024-11-14 05:27:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247829947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1585989631] [2024-11-14 05:27:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:59,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:27:59,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:27:59,497 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:27:59,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-14 05:28:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:01,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 05:28:02,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:05,393 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:28:05,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:28:05,434 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:28:05,434 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 33 treesize of output 35 [2024-11-14 05:28:05,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:28:05,979 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 34 treesize of output 29 [2024-11-14 05:28:06,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2024-11-14 05:28:07,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 73 [2024-11-14 05:28:08,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 73 [2024-11-14 05:28:09,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 78 [2024-11-14 05:28:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:28:09,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:28:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1585989631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:28:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:28:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [18] total 34 [2024-11-14 05:28:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979917825] [2024-11-14 05:28:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:28:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:28:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:28:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:28:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1337, Unknown=2, NotChecked=74, Total=1560 [2024-11-14 05:28:09,477 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:28:15,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:17,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:20,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:26,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:30,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:32,863 INFO L93 Difference]: Finished difference Result 470 states and 609 transitions. [2024-11-14 05:28:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:28:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:28:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:32,868 INFO L225 Difference]: With dead ends: 470 [2024-11-14 05:28:32,868 INFO L226 Difference]: Without dead ends: 311 [2024-11-14 05:28:32,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=337, Invalid=2971, Unknown=2, NotChecked=112, Total=3422 [2024-11-14 05:28:32,870 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 429 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:32,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1144 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 19.4s Time] [2024-11-14 05:28:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-14 05:28:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 164. [2024-11-14 05:28:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 149 states have internal predecessors, (191), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:28:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2024-11-14 05:28:32,886 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 129 [2024-11-14 05:28:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:32,886 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2024-11-14 05:28:32,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:28:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2024-11-14 05:28:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:28:32,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:32,888 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:28:32,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2024-11-14 05:28:33,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:28:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:28:33,289 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:28:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1635442064, now seen corresponding path program 1 times [2024-11-14 05:28:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:28:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406175715] [2024-11-14 05:28:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:33,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:28:33,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:28:33,292 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:28:33,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:28:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:34,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-14 05:28:34,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:35,764 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 05:28:37,086 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 05:28:37,910 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 05:28:38,662 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 05:28:39,299 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 05:28:40,023 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 05:28:40,582 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 05:28:41,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:28:41,469 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 43 treesize of output 41 [2024-11-14 05:28:42,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2024-11-14 05:28:42,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2024-11-14 05:28:43,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 72 [2024-11-14 05:28:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:28:43,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:28:44,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1185))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))))))))) is different from false [2024-11-14 05:28:48,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1182 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1181) c_~var_1_15_Pointer~0.base v_ArrVal_1182))) (let ((.cse2 (store .cse0 c_~var_1_1_Pointer~0.base (store (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32))))))))) (or (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (let ((.cse1 (store (store .cse2 c_~var_1_7_Pointer~0.base v_ArrVal_1184) c_~var_1_8_Pointer~0.base v_ArrVal_1185))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))))) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (bvshl .cse3 .cse3)))))))) is different from false [2024-11-14 05:28:48,774 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:28:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406175715] [2024-11-14 05:28:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406175715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778990357] [2024-11-14 05:28:48,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:28:48,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:28:48,776 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:28:48,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-14 05:28:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:51,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:28:51,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:53,774 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:28:53,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:28:53,814 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:28:53,814 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 33 treesize of output 35 [2024-11-14 05:28:53,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:28:54,655 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 43 treesize of output 41 [2024-11-14 05:28:57,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2024-11-14 05:28:57,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2024-11-14 05:28:58,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 83 [2024-11-14 05:28:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:28:58,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:28:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1778990357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:28:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:28:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [26] total 40 [2024-11-14 05:28:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130436283] [2024-11-14 05:28:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:28:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:28:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:28:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:28:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2362, Unknown=31, NotChecked=202, Total=2862 [2024-11-14 05:28:58,837 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:29:09,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:29:11,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:29:18,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:29:20,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:29:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:23,573 INFO L93 Difference]: Finished difference Result 482 states and 626 transitions. [2024-11-14 05:29:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:29:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:29:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:23,575 INFO L225 Difference]: With dead ends: 482 [2024-11-14 05:29:23,576 INFO L226 Difference]: Without dead ends: 321 [2024-11-14 05:29:23,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=554, Invalid=4392, Unknown=32, NotChecked=278, Total=5256 [2024-11-14 05:29:23,579 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 320 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:23,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1163 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2024-11-14 05:29:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-14 05:29:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 164. [2024-11-14 05:29:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 149 states have internal predecessors, (191), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:29:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2024-11-14 05:29:23,595 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 129 [2024-11-14 05:29:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:23,595 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2024-11-14 05:29:23,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:29:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2024-11-14 05:29:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:29:23,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:23,597 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:23,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2024-11-14 05:29:23,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:29:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:23,998 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:29:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash -736297198, now seen corresponding path program 1 times [2024-11-14 05:29:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:29:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839525372] [2024-11-14 05:29:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:29:24,001 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:29:24,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:29:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:24,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:29:24,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:25,151 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 05:29:26,428 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 05:29:27,214 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 05:29:27,914 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 05:29:28,523 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 05:29:29,026 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 05:29:29,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 18 treesize of output 13 [2024-11-14 05:29:29,919 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 05:29:30,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:29:30,460 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 27 treesize of output 20 [2024-11-14 05:29:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:29:30,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:29:31,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:29:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839525372] [2024-11-14 05:29:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839525372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [188265728] [2024-11-14 05:29:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:29:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:29:31,017 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:29:31,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-14 05:29:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:32,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 05:29:32,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:33,089 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 05:29:34,181 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 05:29:35,082 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 05:29:35,855 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 05:29:36,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:29:37,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 17 treesize of output 12 [2024-11-14 05:29:37,691 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 05:29:38,292 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 05:29:38,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2024-11-14 05:29:39,240 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 26 treesize of output 19 [2024-11-14 05:29:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:29:39,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:29:39,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_1305) c_~var_1_2_Pointer~0.base) c_~var_1_2_Pointer~0.offset)) (_ bv0 8)))) is different from false [2024-11-14 05:29:39,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1303) c_~var_1_15_Pointer~0.base v_ArrVal_1304))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_2_Pointer~0.base) c_~var_1_2_Pointer~0.offset))) (not (= ((_ extract 7 0) (select (select (store .cse0 c_~var_1_1_Pointer~0.base v_ArrVal_1263) c_~var_1_2_Pointer~0.base) c_~var_1_2_Pointer~0.offset)) (_ bv0 8)))))) is different from false [2024-11-14 05:29:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [188265728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790803829] [2024-11-14 05:29:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:39,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:39,601 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:29:39,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 05:29:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:40,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:29:40,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:41,335 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 05:29:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:29:41,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:29:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790803829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:29:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:29:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18, 14] total 34 [2024-11-14 05:29:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406697868] [2024-11-14 05:29:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:29:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:29:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:29:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:29:41,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1219, Unknown=44, NotChecked=150, Total=1640 [2024-11-14 05:29:41,437 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:29:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:44,587 INFO L93 Difference]: Finished difference Result 314 states and 412 transitions. [2024-11-14 05:29:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:29:44,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:29:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:44,588 INFO L225 Difference]: With dead ends: 314 [2024-11-14 05:29:44,588 INFO L226 Difference]: Without dead ends: 153 [2024-11-14 05:29:44,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=237, Invalid=1286, Unknown=45, NotChecked=154, Total=1722 [2024-11-14 05:29:44,590 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 74 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:44,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 387 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-14 05:29:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-14 05:29:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-14 05:29:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:29:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2024-11-14 05:29:44,602 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 129 [2024-11-14 05:29:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:44,603 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2024-11-14 05:29:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:29:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2024-11-14 05:29:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:29:44,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:44,604 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:44,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:29:44,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-14 05:29:45,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-14 05:29:45,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:45,205 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:29:45,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash 637005964, now seen corresponding path program 1 times [2024-11-14 05:29:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:29:45,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986958843] [2024-11-14 05:29:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:29:45,207 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:29:45,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:29:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:46,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 05:29:46,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:48,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 8 treesize of output 1 [2024-11-14 05:29:50,475 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 27 treesize of output 20 [2024-11-14 05:29:51,710 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 27 treesize of output 20 [2024-11-14 05:29:52,857 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 27 treesize of output 20 [2024-11-14 05:29:53,678 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 27 treesize of output 20 [2024-11-14 05:29:54,443 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 27 treesize of output 20 [2024-11-14 05:29:55,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 27 treesize of output 20 [2024-11-14 05:29:55,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:29:56,558 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 51 treesize of output 45 [2024-11-14 05:29:58,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2024-11-14 05:29:58,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2024-11-14 05:29:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 82 [2024-11-14 05:30:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:30:00,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:30:01,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1380))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (or (bvslt (_ bv29916 32) .cse0) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) .cse0))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))))))) is different from false [2024-11-14 05:30:01,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1379 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_1379) c_~var_1_8_Pointer~0.base v_ArrVal_1380))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (or (bvslt (_ bv29916 32) .cse0) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (_ bv17222 32) .cse0)))))))) is different from false [2024-11-14 05:30:11,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1376 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem12#1_75| (_ BitVec 8)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1377) c_~var_1_15_Pointer~0.base v_ArrVal_1376))) (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse8 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (let ((.cse5 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse8 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32)) .cse6))))) (let ((.cse7 (store .cse8 c_~var_1_1_Pointer~0.base (store (select .cse8 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset .cse5)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse7 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (.cse0 (store (store .cse7 c_~var_1_7_Pointer~0.base v_ArrVal_1379) c_~var_1_8_Pointer~0.base v_ArrVal_1380))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) (.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse7 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) (.cse3 (bvshl .cse2 .cse2))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) .cse1))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))) (bvsgt .cse2 .cse3) (bvslt (_ bv29916 32) .cse1) (bvsge .cse4 (bvadd ((_ zero_extend 16) ((_ extract 15 0) .cse5)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_75|))) (not (bvsle .cse4 .cse3)) (bvslt (_ bv29916 32) .cse6))))))))) is different from false [2024-11-14 05:30:11,974 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986958843] [2024-11-14 05:30:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986958843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:30:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528876339] [2024-11-14 05:30:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:30:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:30:11,976 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:30:11,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-14 05:30:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:14,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 05:30:14,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:19,455 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:30:19,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:30:19,555 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:30:19,555 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 33 treesize of output 35 [2024-11-14 05:30:19,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:30:20,979 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 51 treesize of output 45 [2024-11-14 05:30:26,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 87 [2024-11-14 05:30:27,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 87 [2024-11-14 05:30:29,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 96 [2024-11-14 05:30:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:30:30,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [528876339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:30:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [31] total 45 [2024-11-14 05:30:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352132513] [2024-11-14 05:30:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:30,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:30:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:30:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2987, Unknown=12, NotChecked=342, Total=3660 [2024-11-14 05:30:30,029 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:30:40,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:30:43,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:30:47,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:30:58,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:01,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:03,245 INFO L93 Difference]: Finished difference Result 393 states and 505 transitions. [2024-11-14 05:31:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:31:03,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:31:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:03,248 INFO L225 Difference]: With dead ends: 393 [2024-11-14 05:31:03,248 INFO L226 Difference]: Without dead ends: 243 [2024-11-14 05:31:03,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=562, Invalid=4988, Unknown=12, NotChecked=444, Total=6006 [2024-11-14 05:31:03,250 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 258 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:03,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1198 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 27.4s Time] [2024-11-14 05:31:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-14 05:31:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 153. [2024-11-14 05:31:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:31:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2024-11-14 05:31:03,268 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 129 [2024-11-14 05:31:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:03,269 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2024-11-14 05:31:03,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:31:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2024-11-14 05:31:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:31:03,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:03,270 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:03,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:31:03,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2024-11-14 05:31:03,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:31:03,672 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:31:03,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash 855860682, now seen corresponding path program 1 times [2024-11-14 05:31:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405876240] [2024-11-14 05:31:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:03,675 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:03,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Waiting until timeout for monitored process [2024-11-14 05:31:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:04,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 05:31:04,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:07,306 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 05:31:10,768 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 27 treesize of output 20 [2024-11-14 05:31:12,222 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 27 treesize of output 20 [2024-11-14 05:31:13,504 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 27 treesize of output 20 [2024-11-14 05:31:14,618 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 27 treesize of output 20 [2024-11-14 05:31:15,503 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 27 treesize of output 20 [2024-11-14 05:31:16,385 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 27 treesize of output 20 [2024-11-14 05:31:17,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:31:17,487 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 27 treesize of output 20 [2024-11-14 05:31:17,775 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 27 treesize of output 15 [2024-11-14 05:31:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:31:17,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:19,219 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405876240] [2024-11-14 05:31:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405876240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:19,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [920257372] [2024-11-14 05:31:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:19,220 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:31:19,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:31:19,222 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:31:19,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2024-11-14 05:31:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:22,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 05:31:22,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:27,747 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:31:27,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:31:27,829 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:31:27,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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-14 05:31:28,947 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 51 treesize of output 45 [2024-11-14 05:31:31,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 81 [2024-11-14 05:31:32,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 81 [2024-11-14 05:31:34,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 90 [2024-11-14 05:31:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:31:34,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [920257372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:34,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [20] total 35 [2024-11-14 05:31:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010073743] [2024-11-14 05:31:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:34,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:31:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:34,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:31:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1351, Unknown=30, NotChecked=0, Total=1560 [2024-11-14 05:31:34,468 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:31:44,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:49,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:52,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:53,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:04,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:08,455 INFO L93 Difference]: Finished difference Result 430 states and 551 transitions. [2024-11-14 05:32:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:32:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:32:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:08,458 INFO L225 Difference]: With dead ends: 430 [2024-11-14 05:32:08,458 INFO L226 Difference]: Without dead ends: 280 [2024-11-14 05:32:08,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=355, Invalid=2921, Unknown=30, NotChecked=0, Total=3306 [2024-11-14 05:32:08,459 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 322 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:08,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1056 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1353 Invalid, 1 Unknown, 0 Unchecked, 28.6s Time] [2024-11-14 05:32:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-14 05:32:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 140. [2024-11-14 05:32:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 125 states have (on average 1.256) internal successors, (157), 125 states have internal predecessors, (157), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:32:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2024-11-14 05:32:08,474 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 129 [2024-11-14 05:32:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:08,475 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2024-11-14 05:32:08,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:32:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2024-11-14 05:32:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:32:08,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:08,476 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:08,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2024-11-14 05:32:08,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:32:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:32:08,877 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:32:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1623251094, now seen corresponding path program 1 times [2024-11-14 05:32:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:32:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615936325] [2024-11-14 05:32:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:32:08,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:32:08,880 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:32:08,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 (43)] Waiting until timeout for monitored process [2024-11-14 05:32:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:09,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 05:32:09,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:10,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 17 treesize of output 12 [2024-11-14 05:32:12,500 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 05:32:15,755 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 35 treesize of output 31 [2024-11-14 05:32:17,452 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 35 treesize of output 31 [2024-11-14 05:32:19,067 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 35 treesize of output 31 [2024-11-14 05:32:20,579 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 35 treesize of output 31 [2024-11-14 05:32:21,865 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 35 treesize of output 31 [2024-11-14 05:32:23,152 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 35 treesize of output 31 [2024-11-14 05:32:24,388 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 40 treesize of output 31 [2024-11-14 05:32:25,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 76 [2024-11-14 05:32:26,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2024-11-14 05:32:27,559 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 166 treesize of output 86 [2024-11-14 05:32:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:32:27,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:28,475 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1535))) (= (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))))))) is different from false [2024-11-14 05:32:30,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1532 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1532) c_~var_1_15_Pointer~0.base v_ArrVal_1531))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) (.cse4 (bvshl .cse2 .cse2))) (or (let ((.cse0 (store (store .cse1 c_~var_1_7_Pointer~0.base (store (select .cse1 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset (bvadd .cse2 .cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))))) c_~var_1_8_Pointer~0.base v_ArrVal_1535))) (= (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (select (select .cse0 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (bvsgt .cse2 .cse4) (bvsle .cse3 .cse4)))))) is different from false [2024-11-14 05:32:30,377 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:32:30,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615936325] [2024-11-14 05:32:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615936325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:32:30,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1448871476] [2024-11-14 05:32:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:30,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:32:30,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:32:30,379 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:32:30,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2024-11-14 05:32:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:32,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 05:32:32,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:37,380 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:32:37,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:32:37,446 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:32:37,446 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 33 treesize of output 35 [2024-11-14 05:32:37,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:32:38,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 66 [2024-11-14 05:32:39,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2024-11-14 05:32:41,307 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 145 treesize of output 77 [2024-11-14 05:32:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:32:41,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:32:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1448871476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:41,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:32:41,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [26] total 34 [2024-11-14 05:32:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296417762] [2024-11-14 05:32:41,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:41,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:32:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:32:41,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:32:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1334, Unknown=3, NotChecked=154, Total=1722 [2024-11-14 05:32:41,332 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:32:45,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:51,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:52,231 INFO L93 Difference]: Finished difference Result 339 states and 437 transitions. [2024-11-14 05:32:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:32:52,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:32:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:52,234 INFO L225 Difference]: With dead ends: 339 [2024-11-14 05:32:52,234 INFO L226 Difference]: Without dead ends: 202 [2024-11-14 05:32:52,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=333, Invalid=2022, Unknown=5, NotChecked=190, Total=2550 [2024-11-14 05:32:52,235 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 243 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:52,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 626 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-14 05:32:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-14 05:32:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2024-11-14 05:32:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 162 states have (on average 1.2530864197530864) internal successors, (203), 162 states have internal predecessors, (203), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:32:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 227 transitions. [2024-11-14 05:32:52,250 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 227 transitions. Word has length 129 [2024-11-14 05:32:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:52,250 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 227 transitions. [2024-11-14 05:32:52,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:32:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 227 transitions. [2024-11-14 05:32:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:32:52,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:52,251 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:52,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 (43)] Ended with exit code 0 [2024-11-14 05:32:52,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Ended with exit code 0 [2024-11-14 05:32:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:32:52,652 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:32:52,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1685290708, now seen corresponding path program 1 times [2024-11-14 05:32:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:32:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002145245] [2024-11-14 05:32:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:32:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:32:52,656 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:32:52,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:32:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:53,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:32:53,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:55,722 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 32 treesize of output 23 [2024-11-14 05:32:55,816 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 32 treesize of output 23 [2024-11-14 05:32:55,993 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 48 treesize of output 24 [2024-11-14 05:32:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:32:56,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:32:56,082 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:32:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002145245] [2024-11-14 05:32:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002145245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:32:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175186657] [2024-11-14 05:32:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:56,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:32:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:32:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:32:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:32:56,083 INFO L87 Difference]: Start difference. First operand 177 states and 227 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:33:00,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:33:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:33:03,039 INFO L93 Difference]: Finished difference Result 413 states and 528 transitions. [2024-11-14 05:33:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:33:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:33:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:33:03,041 INFO L225 Difference]: With dead ends: 413 [2024-11-14 05:33:03,041 INFO L226 Difference]: Without dead ends: 239 [2024-11-14 05:33:03,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:33:03,042 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 170 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:33:03,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 390 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2024-11-14 05:33:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-14 05:33:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 213. [2024-11-14 05:33:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 198 states have (on average 1.2474747474747474) internal successors, (247), 198 states have internal predecessors, (247), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:33:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 271 transitions. [2024-11-14 05:33:03,058 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 271 transitions. Word has length 129 [2024-11-14 05:33:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:33:03,058 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 271 transitions. [2024-11-14 05:33:03,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:33:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 271 transitions. [2024-11-14 05:33:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-14 05:33:03,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:33:03,059 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:33:03,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:33:03,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:33:03,260 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:33:03,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:33:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1098484694, now seen corresponding path program 1 times [2024-11-14 05:33:03,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:33:03,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963078213] [2024-11-14 05:33:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:33:03,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:33:03,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:33:03,263 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:33:03,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:33:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:33:04,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:33:04,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:33:05,207 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 05:33:07,295 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 05:33:11,012 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 35 treesize of output 31 [2024-11-14 05:33:12,797 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 35 treesize of output 31 [2024-11-14 05:33:14,341 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 35 treesize of output 31 [2024-11-14 05:33:15,839 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 35 treesize of output 31 [2024-11-14 05:33:17,141 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 35 treesize of output 31 [2024-11-14 05:33:18,392 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 35 treesize of output 31 [2024-11-14 05:33:19,674 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 40 treesize of output 31 [2024-11-14 05:33:20,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2024-11-14 05:33:20,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2024-11-14 05:33:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:33:22,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:33:23,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1642))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (or (= (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) (bvadd .cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))) (not (bvsgt .cse1 (bvshl .cse1 .cse1))))))) is different from false [2024-11-14 05:33:27,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1639 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1642 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1638) c_~var_1_15_Pointer~0.base v_ArrVal_1639))) (store .cse2 c_~var_1_7_Pointer~0.base (store (select .cse2 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))))))) c_~var_1_8_Pointer~0.base v_ArrVal_1642))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (or (= (bvadd .cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))) (select (select .cse1 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset)) (not (bvsgt .cse0 (bvshl .cse0 .cse0))))))) is different from false [2024-11-14 05:33:27,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:33:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963078213] [2024-11-14 05:33:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963078213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:33:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [485643882] [2024-11-14 05:33:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:33:27,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:33:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:33:27,494 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:33:27,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2024-11-14 05:33:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:33:29,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:33:29,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:33:33,895 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:33:33,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:33:33,973 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:33:33,973 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 33 treesize of output 35 [2024-11-14 05:33:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-11-14 05:33:35,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2024-11-14 05:33:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:33:36,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:33:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [485643882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:33:36,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:33:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 30 [2024-11-14 05:33:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330327482] [2024-11-14 05:33:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:33:36,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:33:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:33:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:33:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1080, Unknown=11, NotChecked=138, Total=1406 [2024-11-14 05:33:36,105 INFO L87 Difference]: Start difference. First operand 213 states and 271 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:33:44,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:33:44,177 INFO L93 Difference]: Finished difference Result 482 states and 610 transitions. [2024-11-14 05:33:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:33:44,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-14 05:33:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:33:44,179 INFO L225 Difference]: With dead ends: 482 [2024-11-14 05:33:44,179 INFO L226 Difference]: Without dead ends: 272 [2024-11-14 05:33:44,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=233, Invalid=1403, Unknown=12, NotChecked=158, Total=1806 [2024-11-14 05:33:44,181 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 298 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:33:44,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 432 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-14 05:33:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-14 05:33:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 243. [2024-11-14 05:33:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 228 states have (on average 1.236842105263158) internal successors, (282), 228 states have internal predecessors, (282), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:33:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 306 transitions. [2024-11-14 05:33:44,199 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 306 transitions. Word has length 129 [2024-11-14 05:33:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:33:44,199 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 306 transitions. [2024-11-14 05:33:44,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:33:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 306 transitions. [2024-11-14 05:33:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-14 05:33:44,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:33:44,201 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:33:44,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2024-11-14 05:33:44,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Forceful destruction successful, exit code 0 [2024-11-14 05:33:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:33:44,602 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:33:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:33:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 438153644, now seen corresponding path program 1 times [2024-11-14 05:33:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:33:44,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085723180] [2024-11-14 05:33:44,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:33:44,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:33:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:33:44,604 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:33:44,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:33:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:33:45,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:33:45,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:33:47,873 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 05:33:48,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 17 treesize of output 12 [2024-11-14 05:33:48,127 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 05:33:48,300 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 37 treesize of output 25 [2024-11-14 05:33:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:33:48,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:33:48,441 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:33:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085723180] [2024-11-14 05:33:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085723180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:33:48,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:33:48,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:33:48,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757867519] [2024-11-14 05:33:48,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:33:48,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:33:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:33:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:33:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:33:48,443 INFO L87 Difference]: Start difference. First operand 243 states and 306 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:33:50,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:33:52,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:33:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:33:55,850 INFO L93 Difference]: Finished difference Result 603 states and 758 transitions. [2024-11-14 05:33:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:33:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-14 05:33:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:33:55,852 INFO L225 Difference]: With dead ends: 603 [2024-11-14 05:33:55,852 INFO L226 Difference]: Without dead ends: 363 [2024-11-14 05:33:55,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:33:55,853 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 162 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:33:55,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 625 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-14 05:33:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-14 05:33:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 291. [2024-11-14 05:33:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 276 states have (on average 1.2572463768115942) internal successors, (347), 276 states have internal predecessors, (347), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:33:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 371 transitions. [2024-11-14 05:33:55,869 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 371 transitions. Word has length 130 [2024-11-14 05:33:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:33:55,869 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 371 transitions. [2024-11-14 05:33:55,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:33:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 371 transitions. [2024-11-14 05:33:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-14 05:33:55,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:33:55,871 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:33:55,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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)] Ended with exit code 0 [2024-11-14 05:33:56,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:33:56,072 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:33:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:33:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1933585618, now seen corresponding path program 1 times [2024-11-14 05:33:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:33:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39283582] [2024-11-14 05:33:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:33:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:33:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:33:56,075 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:33:56,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 (49)] Waiting until timeout for monitored process [2024-11-14 05:33:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:33:57,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 05:33:57,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:33:59,638 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 05:34:02,133 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 05:34:03,575 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 05:34:04,930 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 05:34:06,176 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 05:34:07,262 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 05:34:08,275 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 05:34:09,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-14 05:34:10,044 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 34 treesize of output 36 [2024-11-14 05:34:10,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2024-11-14 05:34:10,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2024-11-14 05:34:11,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-11-14 05:34:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:34:11,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:11,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_property_#t~mem94#1_60| (_ BitVec 8)) (v_ArrVal_1756 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1756))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_property_#t~mem94#1_60|) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))))))) is different from false [2024-11-14 05:34:12,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_property_#t~mem94#1_60| (_ BitVec 8)) (v_ArrVal_1755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1756 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) |c_ULTIMATE.start_step_#t~ite10#1| (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem7#1|)) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1755) c_~var_1_8_Pointer~0.base v_ArrVal_1756))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_property_#t~mem94#1_60|) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))))) is different from false [2024-11-14 05:34:12,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_property_#t~mem94#1_60| (_ BitVec 8)) (v_ArrVal_1755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1756 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem7#1|)) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1755) c_~var_1_8_Pointer~0.base v_ArrVal_1756))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_property_#t~mem94#1_60|) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))))) is different from false [2024-11-14 05:34:12,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_property_#t~mem94#1_60| (_ BitVec 8)) (v_ArrVal_1755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1756 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1755) c_~var_1_8_Pointer~0.base v_ArrVal_1756))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) ((_ zero_extend 24) |v_ULTIMATE.start_property_#t~mem94#1_60|)))))) is different from false [2024-11-14 05:34:12,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1753 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_property_#t~mem94#1_60| (_ BitVec 8)) (v_ArrVal_1755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1756 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store (let ((.cse1 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1753) c_~var_1_15_Pointer~0.base v_ArrVal_1752))) (store .cse1 c_~var_1_1_Pointer~0.base (store (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))) (_ bv2 32)) (_ bv47138 32))))))) c_~var_1_7_Pointer~0.base v_ArrVal_1755) c_~var_1_8_Pointer~0.base v_ArrVal_1756))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_property_#t~mem94#1_60|) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))))) is different from false [2024-11-14 05:34:12,285 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:12,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39283582] [2024-11-14 05:34:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39283582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:34:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1688214208] [2024-11-14 05:34:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:12,286 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:34:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:34:12,288 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:34:12,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2024-11-14 05:34:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:14,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:34:14,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:19,968 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:34:19,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:34:20,055 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:34:20,055 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 33 treesize of output 35 [2024-11-14 05:34:20,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:34:20,926 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 34 treesize of output 29 [2024-11-14 05:34:23,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 93 [2024-11-14 05:34:23,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 93 [2024-11-14 05:34:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:34:27,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:34:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1688214208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:34:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:34:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 35 [2024-11-14 05:34:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051734707] [2024-11-14 05:34:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:34:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:34:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:34:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1244, Unknown=24, NotChecked=380, Total=1806 [2024-11-14 05:34:27,082 INFO L87 Difference]: Start difference. First operand 291 states and 371 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:34:36,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:38,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:40,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:49,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:51,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:52,369 INFO L93 Difference]: Finished difference Result 686 states and 868 transitions. [2024-11-14 05:34:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:34:52,370 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-14 05:34:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:52,372 INFO L225 Difference]: With dead ends: 686 [2024-11-14 05:34:52,372 INFO L226 Difference]: Without dead ends: 398 [2024-11-14 05:34:52,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=315, Invalid=2543, Unknown=24, NotChecked=540, Total=3422 [2024-11-14 05:34:52,373 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 249 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:52,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 897 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 20.7s Time] [2024-11-14 05:34:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-14 05:34:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 307. [2024-11-14 05:34:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 292 states have (on average 1.2568493150684932) internal successors, (367), 292 states have internal predecessors, (367), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:34:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 391 transitions. [2024-11-14 05:34:52,395 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 391 transitions. Word has length 130 [2024-11-14 05:34:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:52,395 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 391 transitions. [2024-11-14 05:34:52,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:34:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 391 transitions. [2024-11-14 05:34:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-14 05:34:52,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:52,397 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:34:52,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 (49)] Forceful destruction successful, exit code 0 [2024-11-14 05:34:52,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (50)] Ended with exit code 0 [2024-11-14 05:34:52,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:34:52,797 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:34:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1374037810, now seen corresponding path program 1 times [2024-11-14 05:34:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742866050] [2024-11-14 05:34:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:52,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:52,800 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:52,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:34:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:53,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:34:53,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:54,337 INFO L349 Elim1Store]: treesize reduction 3, result has 91.9 percent of original size [2024-11-14 05:34:54,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 84 [2024-11-14 05:34:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:34:54,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:34:54,501 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742866050] [2024-11-14 05:34:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742866050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:34:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:34:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:34:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033913001] [2024-11-14 05:34:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:34:54,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:34:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:34:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:34:54,503 INFO L87 Difference]: Start difference. First operand 307 states and 391 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:34:57,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:00,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:04,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:05,385 INFO L93 Difference]: Finished difference Result 649 states and 821 transitions. [2024-11-14 05:35:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:35:05,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-14 05:35:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:05,387 INFO L225 Difference]: With dead ends: 649 [2024-11-14 05:35:05,387 INFO L226 Difference]: Without dead ends: 345 [2024-11-14 05:35:05,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:35:05,388 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 33 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:05,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 691 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-14 05:35:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-14 05:35:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2024-11-14 05:35:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 258 states have (on average 1.244186046511628) internal successors, (321), 258 states have internal predecessors, (321), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:35:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 345 transitions. [2024-11-14 05:35:05,413 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 345 transitions. Word has length 130 [2024-11-14 05:35:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:05,414 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 345 transitions. [2024-11-14 05:35:05,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:35:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 345 transitions. [2024-11-14 05:35:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-14 05:35:05,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:05,416 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:05,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:35:05,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:35:05,616 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:35:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1504447173, now seen corresponding path program 1 times [2024-11-14 05:35:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:35:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298449252] [2024-11-14 05:35:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:35:05,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:35:05,619 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:35:05,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:35:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:06,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:35:06,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:08,798 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 05:35:11,870 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 27 treesize of output 20 [2024-11-14 05:35:13,351 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 27 treesize of output 20 [2024-11-14 05:35:14,683 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 27 treesize of output 20 [2024-11-14 05:35:15,860 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 27 treesize of output 20 [2024-11-14 05:35:16,938 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 27 treesize of output 20 [2024-11-14 05:35:17,927 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 27 treesize of output 20 [2024-11-14 05:35:18,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:35:20,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 50 treesize of output 42 [2024-11-14 05:35:20,564 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 50 treesize of output 42 [2024-11-14 05:35:21,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 35 [2024-11-14 05:35:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:35:21,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:22,260 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1863))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (bvshl .cse1 .cse1))))) is different from false [2024-11-14 05:35:22,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_1862) c_~var_1_8_Pointer~0.base v_ArrVal_1863))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (bvshl .cse1 .cse1))))) is different from false [2024-11-14 05:35:23,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1860 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1861) c_~var_1_15_Pointer~0.base v_ArrVal_1860))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (let ((.cse4 (bvshl .cse3 .cse3))) (or (let ((.cse0 (store (store .cse2 c_~var_1_7_Pointer~0.base v_ArrVal_1862) c_~var_1_8_Pointer~0.base v_ArrVal_1863))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (bvshl .cse1 .cse1)))) (bvsgt .cse3 .cse4) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) .cse4))))))) is different from false [2024-11-14 05:35:23,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:35:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298449252] [2024-11-14 05:35:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298449252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [219176987] [2024-11-14 05:35:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:35:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:35:23,659 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:35:23,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2024-11-14 05:35:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:26,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:35:26,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:30,783 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:35:30,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:35:30,862 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:35:30,862 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 33 treesize of output 35 [2024-11-14 05:35:30,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:35:32,399 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 53 [2024-11-14 05:35:32,809 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 53 [2024-11-14 05:35:33,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 42 [2024-11-14 05:35:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:35:34,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:35:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [219176987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:35:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [25] total 34 [2024-11-14 05:35:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210483034] [2024-11-14 05:35:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:35:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:35:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:35:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1452, Unknown=4, NotChecked=240, Total=1892 [2024-11-14 05:35:34,206 INFO L87 Difference]: Start difference. First operand 273 states and 345 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:35:38,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:45,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:47,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:48,203 INFO L93 Difference]: Finished difference Result 636 states and 796 transitions. [2024-11-14 05:35:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:35:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-14 05:35:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:48,205 INFO L225 Difference]: With dead ends: 636 [2024-11-14 05:35:48,205 INFO L226 Difference]: Without dead ends: 366 [2024-11-14 05:35:48,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=263, Invalid=1906, Unknown=5, NotChecked=276, Total=2450 [2024-11-14 05:35:48,206 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 265 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:48,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 478 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2024-11-14 05:35:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-14 05:35:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 282. [2024-11-14 05:35:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 267 states have (on average 1.2397003745318351) internal successors, (331), 267 states have internal predecessors, (331), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:35:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 355 transitions. [2024-11-14 05:35:48,223 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 355 transitions. Word has length 131 [2024-11-14 05:35:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:48,223 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 355 transitions. [2024-11-14 05:35:48,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:35:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 355 transitions. [2024-11-14 05:35:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-14 05:35:48,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:48,225 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:48,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:35:48,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (53)] Ended with exit code 0 [2024-11-14 05:35:48,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:35:48,626 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:35:48,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2091253187, now seen corresponding path program 1 times [2024-11-14 05:35:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:35:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745940986] [2024-11-14 05:35:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:48,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:35:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:35:48,629 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:35:48,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:35:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:49,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:35:49,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:52,037 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 05:35:55,063 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 27 treesize of output 20 [2024-11-14 05:35:56,511 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 27 treesize of output 20 [2024-11-14 05:35:57,873 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 27 treesize of output 20 [2024-11-14 05:35:59,137 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 27 treesize of output 20 [2024-11-14 05:36:00,365 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 27 treesize of output 20 [2024-11-14 05:36:01,404 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 27 treesize of output 20 [2024-11-14 05:36:02,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:36:03,722 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 50 treesize of output 42 [2024-11-14 05:36:04,025 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 50 treesize of output 42 [2024-11-14 05:36:04,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2024-11-14 05:36:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:36:04,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:05,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem104#1| (_ BitVec 8))) (not (bvsgt ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem104#1|) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_1936) c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (bvshl .cse0 .cse0))))) is different from false [2024-11-14 05:36:06,753 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem104#1| (_ BitVec 8)) (~var_1_13_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_1934) c_~var_1_15_Pointer~0.base v_ArrVal_1933))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (let ((.cse1 (bvshl .cse0 .cse0))) (or (bvsgt .cse0 .cse1) (not (bvsgt ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem104#1|) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse3 c_~var_1_7_Pointer~0.base v_ArrVal_1935) c_~var_1_8_Pointer~0.base v_ArrVal_1936) c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (bvshl .cse2 .cse2)))) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) .cse1))))))) is different from false [2024-11-14 05:36:06,881 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:36:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745940986] [2024-11-14 05:36:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745940986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [91065198] [2024-11-14 05:36:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:06,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:36:06,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:36:06,884 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:36:06,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2024-11-14 05:36:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:09,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 05:36:09,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:13,109 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:36:13,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:36:13,187 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:36:13,187 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 33 treesize of output 35 [2024-11-14 05:36:13,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:36:14,415 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 42 treesize of output 31 [2024-11-14 05:36:14,771 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 42 treesize of output 31 [2024-11-14 05:36:15,286 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 58 treesize of output 30 [2024-11-14 05:36:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:36:15,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:36:15,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [91065198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:15,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:36:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [24] total 31 [2024-11-14 05:36:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834751871] [2024-11-14 05:36:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:36:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:36:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:36:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1238, Unknown=13, NotChecked=146, Total=1560 [2024-11-14 05:36:15,656 INFO L87 Difference]: Start difference. First operand 282 states and 355 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:36:20,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:36:22,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:36:24,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:36:29,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:36:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:29,495 INFO L93 Difference]: Finished difference Result 648 states and 808 transitions. [2024-11-14 05:36:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:36:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-14 05:36:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:29,497 INFO L225 Difference]: With dead ends: 648 [2024-11-14 05:36:29,498 INFO L226 Difference]: Without dead ends: 369 [2024-11-14 05:36:29,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=191, Invalid=1526, Unknown=13, NotChecked=162, Total=1892 [2024-11-14 05:36:29,499 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 242 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:29,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 430 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2024-11-14 05:36:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-14 05:36:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 282. [2024-11-14 05:36:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 267 states have (on average 1.2359550561797752) internal successors, (330), 267 states have internal predecessors, (330), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 05:36:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 354 transitions. [2024-11-14 05:36:29,521 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 354 transitions. Word has length 131 [2024-11-14 05:36:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:29,522 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 354 transitions. [2024-11-14 05:36:29,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 05:36:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 354 transitions. [2024-11-14 05:36:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-14 05:36:29,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:29,523 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:29,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 05:36:29,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (55)] Ended with exit code 0 [2024-11-14 05:36:29,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:36:29,924 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:36:29,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 466796847, now seen corresponding path program 1 times [2024-11-14 05:36:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:36:29,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394987732] [2024-11-14 05:36:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:36:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:36:29,927 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:36:29,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/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 (56)] Waiting until timeout for monitored process [2024-11-14 05:36:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:31,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 05:36:31,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:33,558 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 05:36:36,699 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 27 treesize of output 20 [2024-11-14 05:36:38,172 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 27 treesize of output 20 [2024-11-14 05:36:39,495 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 27 treesize of output 20 [2024-11-14 05:36:40,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 27 treesize of output 20 [2024-11-14 05:36:41,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:36:42,825 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 27 treesize of output 20 [2024-11-14 05:36:43,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-14 05:36:44,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 70 treesize of output 58 [2024-11-14 05:36:45,127 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 70 treesize of output 58 [2024-11-14 05:36:46,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 59 [2024-11-14 05:36:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:36:46,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:47,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_2009))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_13_Pointer~0.base) c_~var_1_13_Pointer~0.offset))))) (let ((.cse1 (bvshl .cse0 .cse0))) (or (bvsgt .cse0 .cse1) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) .cse1))))))) is different from false [2024-11-14 05:36:48,496 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_13_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem20#1| (_ BitVec 8)) (v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_13_Pointer~0.base v_ArrVal_2007) c_~var_1_15_Pointer~0.base v_ArrVal_2006))) (let ((.cse2 (store (store .cse1 c_~var_1_7_Pointer~0.base v_ArrVal_2008) c_~var_1_8_Pointer~0.base v_ArrVal_2009))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (let ((.cse0 (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (bvshl .cse5 .cse5))) (.cse3 (bvshl .cse4 .cse4))) (or (bvsgt ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem20#1|) .cse0) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) .cse0) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) .cse3)) (bvsgt .cse4 .cse3))))))) is different from false [2024-11-14 05:36:48,660 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:36:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394987732] [2024-11-14 05:36:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394987732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [329392081] [2024-11-14 05:36:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:48,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:36:48,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:36:48,662 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:36:48,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62ee4076-3006-4afe-a811-d17a9f8863b9/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2024-11-14 05:36:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:51,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:36:51,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:55,501 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-14 05:36:55,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 05:36:55,577 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:36:55,577 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 33 treesize of output 35 [2024-11-14 05:36:56,828 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 66 treesize of output 54 [2024-11-14 05:36:57,241 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 66 treesize of output 54 [2024-11-14 05:36:58,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2024-11-14 05:36:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 05:36:58,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:36:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [329392081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:36:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [24] total 32 [2024-11-14 05:36:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205010936] [2024-11-14 05:36:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:58,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:36:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:36:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:36:58,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1308, Unknown=6, NotChecked=150, Total=1640 [2024-11-14 05:36:58,754 INFO L87 Difference]: Start difference. First operand 282 states and 354 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)