./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.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_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/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_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/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_35b6fa49-6576-4076-b095-16c0e46bb1b0/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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:47:53,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:47:53,428 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:47:53,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:47:53,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:47:53,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:47:53,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:47:53,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:47:53,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:47:53,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:47:53,496 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:47:53,497 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:47:53,497 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:47:53,497 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:47:53,497 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:47:53,498 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:47:53,498 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:47:53,498 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:47:53,498 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:47:53,498 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:47:53,499 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:47:53,499 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:47:53,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:47:53,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:47:53,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:47:53,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:47:53,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:47:53,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:47:53,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:47:53,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:47:53,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:47:53,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:47:53,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:47:53,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:47:53,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:47:53,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:47:53,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:47:53,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:47:53,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:47:53,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:47:53,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:47:53,505 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_35b6fa49-6576-4076-b095-16c0e46bb1b0/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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2024-11-13 23:47:53,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:47:53,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:47:53,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:47:53,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:47:53,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:47:53,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i Unable to find full path for "g++" [2024-11-13 23:47:56,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:47:56,750 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:47:56,751 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2024-11-13 23:47:56,762 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data/e55fc3d89/0f6f5fb13f34421d9819ca53d31d0743/FLAG8cb85b4d0 [2024-11-13 23:47:56,781 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data/e55fc3d89/0f6f5fb13f34421d9819ca53d31d0743 [2024-11-13 23:47:56,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:47:56,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:47:56,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:47:56,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:47:56,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:47:56,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:47:56" (1/1) ... [2024-11-13 23:47:56,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273b4d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:56, skipping insertion in model container [2024-11-13 23:47:56,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:47:56" (1/1) ... [2024-11-13 23:47:56,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:47:57,022 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_35b6fa49-6576-4076-b095-16c0e46bb1b0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-13 23:47:57,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:47:57,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:47:57,165 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_35b6fa49-6576-4076-b095-16c0e46bb1b0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-13 23:47:57,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:47:57,256 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:47:57,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57 WrapperNode [2024-11-13 23:47:57,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:47:57,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:47:57,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:47:57,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:47:57,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,366 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 574 [2024-11-13 23:47:57,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:47:57,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:47:57,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:47:57,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:47:57,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:47:57,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:47:57,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:47:57,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:47:57,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (1/1) ... [2024-11-13 23:47:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:47:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:47:57,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:47:57,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:47:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:47:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 23:47:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:47:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 23:47:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:47:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-13 23:47:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:47:57,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:47:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:47:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:47:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:47:57,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:47:57,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:47:58,696 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-13 23:47:58,696 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:47:59,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:47:59,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:47:59,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:47:59 BoogieIcfgContainer [2024-11-13 23:47:59,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:47:59,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:47:59,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:47:59,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:47:59,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:47:56" (1/3) ... [2024-11-13 23:47:59,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d77ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:47:59, skipping insertion in model container [2024-11-13 23:47:59,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:47:57" (2/3) ... [2024-11-13 23:47:59,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d77ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:47:59, skipping insertion in model container [2024-11-13 23:47:59,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:47:59" (3/3) ... [2024-11-13 23:47:59,682 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2024-11-13 23:47:59,705 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:47:59,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-56.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:47:59,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:47:59,812 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;@61fe7918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:47:59,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:47:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 23:47:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 23:47:59,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:47:59,831 INFO L215 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:47:59,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:47:59,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:47:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash -835966278, now seen corresponding path program 1 times [2024-11-13 23:47:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:47:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063361088] [2024-11-13 23:47:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:47:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:48:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:48:07,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:48:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:48:10,932 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:48:10,935 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:48:10,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:48:10,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:48:10,945 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 23:48:11,071 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:48:11,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:48:11 BoogieIcfgContainer [2024-11-13 23:48:11,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:48:11,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:48:11,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:48:11,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:48:11,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:47:59" (3/4) ... [2024-11-13 23:48:11,088 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:48:11,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:48:11,091 INFO L158 Benchmark]: Toolchain (without parser) took 14304.51ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 91.8MB in the beginning and 355.0MB in the end (delta: -263.2MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2024-11-13 23:48:11,093 INFO L158 Benchmark]: CDTParser took 1.50ms. Allocated memory is still 117.4MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:48:11,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.14ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:48:11,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.51ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 70.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:48:11,095 INFO L158 Benchmark]: Boogie Preprocessor took 115.26ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 67.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:48:11,095 INFO L158 Benchmark]: RCFGBuilder took 2182.27ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 39.5MB in the end (delta: 27.5MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-13 23:48:11,096 INFO L158 Benchmark]: TraceAbstraction took 11409.76ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 38.8MB in the beginning and 355.0MB in the end (delta: -316.2MB). Peak memory consumption was 265.5MB. Max. memory is 16.1GB. [2024-11-13 23:48:11,096 INFO L158 Benchmark]: Witness Printer took 7.05ms. Allocated memory is still 503.3MB. Free memory was 355.0MB in the beginning and 355.0MB in the end (delta: 68.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:48:11,103 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50ms. Allocated memory is still 117.4MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.14ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.51ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 70.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.26ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 67.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2182.27ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 39.5MB in the end (delta: 27.5MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11409.76ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 38.8MB in the beginning and 355.0MB in the end (delta: -316.2MB). Peak memory consumption was 265.5MB. Max. memory is 16.1GB. * Witness Printer took 7.05ms. Allocated memory is still 503.3MB. Free memory was 355.0MB in the beginning and 355.0MB in the end (delta: 68.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 38, overapproximation of shiftLeft at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25-L27] double double_Array_0[2] = { 10.5, 99.25 }; [L28-L30] signed char signed_char_Array_0[1] = { 0 }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR unsigned_char_Array_0[0][1] [L101] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] double_Array_0[1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L97] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L112] RET updateVariables() [L113] CALL step() [L38] EXPR signed_char_Array_0[0] [L38] EXPR last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0] [L38] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_ [L39] EXPR signed_char_Array_0[0] [L39] EXPR unsigned_char_Array_0[0][2] [L39] EXPR unsigned_char_Array_0[1][1] [L39] EXPR unsigned_char_Array_0[1][0] [L39] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L39] EXPR unsigned_char_Array_0[1][1] [L39] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L39] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L39] EXPR signed_char_Array_0[0] [L39] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L39] unsigned_char_Array_0[1][2] = ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))) [L43] EXPR unsigned_char_Array_0[0][0] [L43] EXPR unsigned_char_Array_0[1][2] [L43] EXPR unsigned_char_Array_0[1][0] [L43] COND FALSE !((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) [L46] EXPR BOOL_unsigned_char_Array_0[0] [L46] BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1] [L46] BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L46] COND TRUE BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L47] EXPR unsigned_char_Array_0[1][2] [L47] EXPR unsigned_char_Array_0[0][0] [L47] EXPR signed_char_Array_0[0] [L47] EXPR unsigned_char_Array_0[0][0] << signed_char_Array_0[0] [L47] COND FALSE !(unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) [L54] EXPR BOOL_unsigned_char_Array_0[4] [L54] BOOL_unsigned_char_Array_0[2] = BOOL_unsigned_char_Array_0[4] [L59] EXPR unsigned_char_Array_0[0][1] [L59] unsigned char stepLocal_1 = unsigned_char_Array_0[0][1]; [L60] EXPR BOOL_unsigned_char_Array_0[2] [L60] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L61] BOOL_unsigned_char_Array_0[2] [L61] COND TRUE BOOL_unsigned_char_Array_0[2] [L62] stepLocal_0 || BOOL_unsigned_char_Array_0[2] [L62] COND TRUE stepLocal_0 || BOOL_unsigned_char_Array_0[2] [L63] EXPR unsigned_char_Array_0[1][1] [L63] COND TRUE stepLocal_1 > unsigned_char_Array_0[1][1] [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR signed_char_Array_0[0] [L104] EXPR last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0] [L104] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0])))))) [L104] EXPR unsigned_char_Array_0[1][2] [L104] EXPR signed_char_Array_0[0] [L104] EXPR unsigned_char_Array_0[0][2] [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR unsigned_char_Array_0[1][0] [L104] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L104] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L104] EXPR signed_char_Array_0[0] [L104] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L104] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0])))))) [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) [L104] EXPR BOOL_unsigned_char_Array_0[2] [L104] EXPR BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1 [L104] EXPR BOOL_unsigned_char_Array_0[2] [L104] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2] [L104] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1 [L104] EXPR unsigned_char_Array_0[0][1] [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR (unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1 [L104] EXPR double_Array_0[0] [L104] EXPR double_Array_0[1] [L104] EXPR (unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1 [L104] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1 [L104] EXPR BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1 [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) [L104] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1) [L104] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) [L104-L105] return (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 1, TraceHistogramMax: 19, 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=47occurred 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, 7.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 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-13 23:48:11,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/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_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/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_35b6fa49-6576-4076-b095-16c0e46bb1b0/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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:48:14,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:48:14,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:48:14,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:48:14,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:48:14,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:48:14,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:48:14,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:48:14,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:48:14,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:48:14,796 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:48:14,796 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:48:14,796 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:48:14,796 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:48:14,796 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:48:14,796 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:48:14,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:48:14,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:48:14,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:48:14,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:48:14,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:48:14,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:48:14,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:48:14,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:48:14,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:48:14,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:48:14,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:48:14,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:48:14,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:48:14,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:48:14,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:48:14,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:48:14,804 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:48:14,804 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:14,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:48:14,804 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:48:14,804 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_35b6fa49-6576-4076-b095-16c0e46bb1b0/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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2024-11-13 23:48:15,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:48:15,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:48:15,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:48:15,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:48:15,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:48:15,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i Unable to find full path for "g++" [2024-11-13 23:48:17,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:48:17,855 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:48:17,859 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2024-11-13 23:48:17,875 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data/1c159a95e/95af4cc0a392453fa88ac0641718dbb0/FLAGc4f2339c4 [2024-11-13 23:48:17,900 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/data/1c159a95e/95af4cc0a392453fa88ac0641718dbb0 [2024-11-13 23:48:17,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:48:17,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:48:17,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:48:17,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:48:17,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:48:17,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:48:17" (1/1) ... [2024-11-13 23:48:17,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bf0907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:17, skipping insertion in model container [2024-11-13 23:48:17,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:48:17" (1/1) ... [2024-11-13 23:48:17,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:48:18,157 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_35b6fa49-6576-4076-b095-16c0e46bb1b0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-13 23:48:18,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:48:18,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:48:18,354 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_35b6fa49-6576-4076-b095-16c0e46bb1b0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-13 23:48:18,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:48:18,477 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:48:18,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18 WrapperNode [2024-11-13 23:48:18,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:48:18,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:48:18,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:48:18,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:48:18,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,608 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2024-11-13 23:48:18,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:48:18,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:48:18,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:48:18,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:48:18,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:48:18,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:48:18,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:48:18,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:48:18,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (1/1) ... [2024-11-13 23:48:18,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:48:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:48:18,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:48:18,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:48:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:48:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-13 23:48:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-13 23:48:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-13 23:48:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:48:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-13 23:48:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:48:18,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:48:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:48:18,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:48:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-13 23:48:19,036 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:48:19,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:48:20,306 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-13 23:48:20,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:48:20,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:48:20,322 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:48:20,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:48:20 BoogieIcfgContainer [2024-11-13 23:48:20,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:48:20,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:48:20,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:48:20,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:48:20,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:48:17" (1/3) ... [2024-11-13 23:48:20,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a7ed2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:48:20, skipping insertion in model container [2024-11-13 23:48:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:48:18" (2/3) ... [2024-11-13 23:48:20,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a7ed2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:48:20, skipping insertion in model container [2024-11-13 23:48:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:48:20" (3/3) ... [2024-11-13 23:48:20,336 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2024-11-13 23:48:20,356 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:48:20,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-56.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:48:20,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:48:20,465 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;@49a338d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:48:20,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:48:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 23:48:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 23:48:20,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:20,495 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:48:20,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:20,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -970718534, now seen corresponding path program 1 times [2024-11-13 23:48:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:20,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616527014] [2024-11-13 23:48:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:20,556 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-13 23:48:20,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:20,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:20,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:21,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:48:21,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 23:48:21,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:48:21,202 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:48:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616527014] [2024-11-13 23:48:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616527014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:48:21,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:48:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:48:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335134592] [2024-11-13 23:48:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:48:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:48:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:48:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:48:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:48:21,252 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:48:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:21,350 INFO L93 Difference]: Finished difference Result 230 states and 365 transitions. [2024-11-13 23:48:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:48:21,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-13 23:48:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:21,369 INFO L225 Difference]: With dead ends: 230 [2024-11-13 23:48:21,370 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 23:48:21,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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-13 23:48:21,381 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:21,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:48:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 23:48:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-13 23:48:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 23:48:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-13 23:48:21,461 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2024-11-13 23:48:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-13 23:48:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:48:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-13 23:48:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 23:48:21,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:21,474 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:48:21,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:21,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:21,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:21,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1635305020, now seen corresponding path program 1 times [2024-11-13 23:48:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174698622] [2024-11-13 23:48:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:21,677 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-13 23:48:21,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:21,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:21,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:22,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 23:48:22,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:22,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:48:24,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:25,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 27 treesize of output 20 [2024-11-13 23:48:25,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:26,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:26,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2024-11-13 23:48:26,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 37 [2024-11-13 23:48:27,101 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 39 [2024-11-13 23:48:27,467 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 54 treesize of output 30 [2024-11-13 23:48:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-13 23:48:27,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:28,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_63))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) is different from false [2024-11-13 23:48:28,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_61 (_ BitVec 32)) (v_ArrVal_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_61)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_63))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) is different from false [2024-11-13 23:48:28,169 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_61 (_ BitVec 32)) (v_ArrVal_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse1 ((_ sign_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_step_#t~ite19#1|))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_61)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_63))) (= ((_ zero_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))))))) is different from false [2024-11-13 23:48:28,903 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:48:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174698622] [2024-11-13 23:48:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174698622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:48:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1913832133] [2024-11-13 23:48:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:28,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:48:28,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:48:28,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-13 23:48:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:29,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 23:48:29,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:30,062 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-13 23:48:32,676 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-13 23:48:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2024-11-13 23:48:32,995 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-13 23:48:32,996 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 44 treesize of output 39 [2024-11-13 23:48:33,436 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 23:48:33,437 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 66 treesize of output 64 [2024-11-13 23:48:33,542 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 25 treesize of output 21 [2024-11-13 23:48:34,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:34,576 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 50 treesize of output 42 [2024-11-13 23:48:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 23:48:34,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:48:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1913832133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:48:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:48:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 30 [2024-11-13 23:48:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423959579] [2024-11-13 23:48:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:48:34,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 23:48:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:48:34,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 23:48:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1235, Unknown=22, NotChecked=222, Total=1640 [2024-11-13 23:48:34,689 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:48:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:39,029 INFO L93 Difference]: Finished difference Result 436 states and 641 transitions. [2024-11-13 23:48:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 23:48:39,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-13 23:48:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:39,034 INFO L225 Difference]: With dead ends: 436 [2024-11-13 23:48:39,035 INFO L226 Difference]: Without dead ends: 324 [2024-11-13 23:48:39,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=229, Invalid=1831, Unknown=22, NotChecked=270, Total=2352 [2024-11-13 23:48:39,052 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 358 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:39,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1068 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 23:48:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-13 23:48:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 193. [2024-11-13 23:48:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 23:48:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2024-11-13 23:48:39,096 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 149 [2024-11-13 23:48:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:39,097 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2024-11-13 23:48:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:48:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2024-11-13 23:48:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 23:48:39,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:39,105 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:48:39,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-13 23:48:39,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 23:48:39,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:39,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -581412079, now seen corresponding path program 1 times [2024-11-13 23:48:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811427446] [2024-11-13 23:48:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:39,507 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-13 23:48:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:39,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:39,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:39,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 23:48:39,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:39,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:48:40,740 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-13 23:48:40,896 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-13 23:48:41,080 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-13 23:48:41,254 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-13 23:48:41,421 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-13 23:48:41,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-13 23:48:41,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 23 treesize of output 18 [2024-11-13 23:48:41,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-13 23:48:41,962 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 23 treesize of output 15 [2024-11-13 23:48:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 23:48:42,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:48:42,018 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:48:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811427446] [2024-11-13 23:48:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811427446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:48:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:48:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:48:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573349988] [2024-11-13 23:48:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:48:42,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:48:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:48:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:48:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:48:42,022 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:48:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:47,452 INFO L93 Difference]: Finished difference Result 413 states and 610 transitions. [2024-11-13 23:48:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:48:47,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-13 23:48:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:47,456 INFO L225 Difference]: With dead ends: 413 [2024-11-13 23:48:47,456 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 23:48:47,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:48:47,461 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 290 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:47,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 515 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-13 23:48:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 23:48:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 212. [2024-11-13 23:48:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 23:48:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 312 transitions. [2024-11-13 23:48:47,516 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 312 transitions. Word has length 150 [2024-11-13 23:48:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:47,517 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 312 transitions. [2024-11-13 23:48:47,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:48:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 312 transitions. [2024-11-13 23:48:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 23:48:47,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:47,520 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:48:47,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 23:48:47,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:47,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1561668227, now seen corresponding path program 1 times [2024-11-13 23:48:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703298711] [2024-11-13 23:48:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:47,723 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-13 23:48:47,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:47,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:47,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:48,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 23:48:48,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:48,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:48:48,884 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-13 23:48:49,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:49,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:49,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:50,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:50,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-13 23:48:50,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-13 23:48:50,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 22 treesize of output 17 [2024-11-13 23:48:50,960 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 22 treesize of output 14 [2024-11-13 23:48:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-13 23:48:51,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:48:51,468 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:48:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703298711] [2024-11-13 23:48:51,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703298711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:48:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [186316146] [2024-11-13 23:48:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:51,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:51,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:48:51,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:48:51,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-13 23:48:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:52,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 23:48:52,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:48:52,725 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-13 23:48:52,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:53,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:53,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 17 treesize of output 12 [2024-11-13 23:48:53,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:48:54,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-13 23:48:54,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-13 23:48:54,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-13 23:48:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 23:48:54,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:48:54,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [186316146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:48:54,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:48:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 22 [2024-11-13 23:48:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636910773] [2024-11-13 23:48:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:48:54,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 23:48:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:48:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 23:48:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=662, Unknown=17, NotChecked=0, Total=812 [2024-11-13 23:48:54,631 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 23:48:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:48:57,400 INFO L93 Difference]: Finished difference Result 453 states and 664 transitions. [2024-11-13 23:48:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:48:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2024-11-13 23:48:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:48:57,404 INFO L225 Difference]: With dead ends: 453 [2024-11-13 23:48:57,404 INFO L226 Difference]: Without dead ends: 341 [2024-11-13 23:48:57,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=742, Unknown=17, NotChecked=0, Total=930 [2024-11-13 23:48:57,406 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 267 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:48:57,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 577 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 23:48:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-13 23:48:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 234. [2024-11-13 23:48:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 191 states have internal predecessors, (266), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 23:48:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2024-11-13 23:48:57,452 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 342 transitions. Word has length 150 [2024-11-13 23:48:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:48:57,453 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 342 transitions. [2024-11-13 23:48:57,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 23:48:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2024-11-13 23:48:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:48:57,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:48:57,456 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:48:57,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-13 23:48:57,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-13 23:48:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:48:57,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:48:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:48:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1560421560, now seen corresponding path program 1 times [2024-11-13 23:48:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:48:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687830269] [2024-11-13 23:48:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:48:57,859 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-13 23:48:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:48:57,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:57,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:48:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:48:58,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 23:48:58,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:48:58,696 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-13 23:48:58,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-13 23:48:59,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:59,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-11-13 23:48:59,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:48:59,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2024-11-13 23:49:00,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:00,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 61 [2024-11-13 23:49:00,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:00,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 64 [2024-11-13 23:49:00,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2024-11-13 23:49:01,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:01,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 38 [2024-11-13 23:49:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 372 proven. 27 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-13 23:49:01,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:01,314 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_236) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|))) (_ bv1 32)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2024-11-13 23:49:13,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687830269] [2024-11-13 23:49:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687830269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1214024326] [2024-11-13 23:49:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:13,865 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:49:13,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:49:13,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:49:13,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-13 23:49:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:14,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 23:49:14,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:15,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:49:16,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 22 treesize of output 21 [2024-11-13 23:49:17,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 39 treesize of output 37 [2024-11-13 23:49:17,591 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 50 treesize of output 40 [2024-11-13 23:49:18,581 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 67 treesize of output 60 [2024-11-13 23:49:18,914 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 78 treesize of output 63 [2024-11-13 23:49:19,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2024-11-13 23:49:19,760 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 79 treesize of output 43 [2024-11-13 23:49:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-13 23:49:19,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1214024326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707841009] [2024-11-13 23:49:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:25,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:49:25,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:25,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:49:25,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 23:49:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:25,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 23:49:25,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:26,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-13 23:49:27,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-13 23:49:27,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:27,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-13 23:49:28,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:28,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 62 [2024-11-13 23:49:29,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 65 [2024-11-13 23:49:29,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2024-11-13 23:49:29,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:29,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 39 [2024-11-13 23:49:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-13 23:49:29,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:30,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_309) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2024-11-13 23:49:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707841009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:32,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:49:32,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 41 [2024-11-13 23:49:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374339882] [2024-11-13 23:49:32,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:49:32,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 23:49:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:32,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 23:49:32,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1876, Unknown=39, NotChecked=186, Total=2450 [2024-11-13 23:49:32,077 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. Second operand has 42 states, 37 states have (on average 4.486486486486487) internal successors, (166), 38 states have internal predecessors, (166), 14 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (44), 12 states have call predecessors, (44), 14 states have call successors, (44) [2024-11-13 23:49:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:47,916 INFO L93 Difference]: Finished difference Result 536 states and 761 transitions. [2024-11-13 23:49:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 23:49:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 4.486486486486487) internal successors, (166), 38 states have internal predecessors, (166), 14 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (44), 12 states have call predecessors, (44), 14 states have call successors, (44) Word has length 151 [2024-11-13 23:49:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:47,922 INFO L225 Difference]: With dead ends: 536 [2024-11-13 23:49:47,922 INFO L226 Difference]: Without dead ends: 424 [2024-11-13 23:49:47,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 487 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=793, Invalid=3450, Unknown=55, NotChecked=258, Total=4556 [2024-11-13 23:49:47,925 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1153 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 3252 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 3252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:47,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1323 Invalid, 3531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 3252 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2024-11-13 23:49:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-13 23:49:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 400. [2024-11-13 23:49:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 336 states have internal predecessors, (464), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:49:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2024-11-13 23:49:47,985 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 151 [2024-11-13 23:49:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:47,986 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2024-11-13 23:49:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 4.486486486486487) internal successors, (166), 38 states have internal predecessors, (166), 14 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (44), 12 states have call predecessors, (44), 14 states have call successors, (44) [2024-11-13 23:49:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2024-11-13 23:49:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:49:47,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:47,991 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:49:47,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:48,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 23:49:48,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-13 23:49:48,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:49:48,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:48,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1818586998, now seen corresponding path program 1 times [2024-11-13 23:49:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:48,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055729682] [2024-11-13 23:49:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:48,593 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-13 23:49:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:48,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:48,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:48,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 23:49:48,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:49,527 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-13 23:49:49,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 23:49:49,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 23:49:49,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 23:49:50,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:50,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2024-11-13 23:49:50,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:50,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2024-11-13 23:49:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2024-11-13 23:49:50,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:50,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 33 [2024-11-13 23:49:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-13 23:49:50,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:50,787 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:50,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055729682] [2024-11-13 23:49:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055729682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 23:49:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109994250] [2024-11-13 23:49:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:50,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:49:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:49:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:49:50,789 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 23:49:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:55,384 INFO L93 Difference]: Finished difference Result 755 states and 1083 transitions. [2024-11-13 23:49:55,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:49:55,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-13 23:49:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:55,392 INFO L225 Difference]: With dead ends: 755 [2024-11-13 23:49:55,392 INFO L226 Difference]: Without dead ends: 505 [2024-11-13 23:49:55,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-13 23:49:55,394 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 273 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:55,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 715 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-13 23:49:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-13 23:49:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 442. [2024-11-13 23:49:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 376 states have (on average 1.4042553191489362) internal successors, (528), 378 states have internal predecessors, (528), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:49:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2024-11-13 23:49:55,466 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 151 [2024-11-13 23:49:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:55,466 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2024-11-13 23:49:55,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 23:49:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2024-11-13 23:49:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:49:55,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:55,470 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:49:55,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:55,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:55,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1465263048, now seen corresponding path program 1 times [2024-11-13 23:49:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:55,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310668717] [2024-11-13 23:49:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:55,672 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-13 23:49:55,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:55,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:55,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:49:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:56,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 23:49:56,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:56,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:49:57,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:49:58,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:49:58,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-13 23:49:59,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-13 23:50:00,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:00,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2024-11-13 23:50:01,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:01,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2024-11-13 23:50:01,322 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 58 treesize of output 50 [2024-11-13 23:50:01,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:01,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 23:50:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 434 proven. 48 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-13 23:50:02,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:50:02,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-13 23:50:02,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (_ BitVec 32)) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_380)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-13 23:50:02,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32)) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_380)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-13 23:50:02,986 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:50:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310668717] [2024-11-13 23:50:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310668717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:50:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [57971111] [2024-11-13 23:50:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:50:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:50:02,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:50:02,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-13 23:50:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:03,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:50:03,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:03,916 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-13 23:50:05,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:50:05,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:50:06,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:50:06,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-13 23:50:08,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-13 23:50:10,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2024-11-13 23:50:10,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2024-11-13 23:50:10,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2024-11-13 23:50:11,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2024-11-13 23:50:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 438 proven. 27 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-13 23:50:11,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:50:11,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-13 23:50:11,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (_ BitVec 32)) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_417)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-13 23:50:11,558 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_417)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-13 23:50:11,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))) (.cse1 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (or (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 ((_ sign_extend 24) |c_ULTIMATE.start_step_#t~mem4#1|)) .cse0)) (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (forall ((v_ArrVal_417 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_417)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) is different from false [2024-11-13 23:50:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [57971111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:50:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766174630] [2024-11-13 23:50:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:50:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:50:16,332 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:50:16,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 23:50:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:16,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 23:50:16,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:16,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:50:17,556 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-13 23:50:19,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 35 treesize of output 26 [2024-11-13 23:50:20,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 23:50:20,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 35 treesize of output 26 [2024-11-13 23:50:21,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 23:50:22,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-11-13 23:50:22,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2024-11-13 23:50:22,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-13 23:50:23,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:23,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-11-13 23:50:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 380 proven. 48 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-13 23:50:23,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:50:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766174630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:50:32,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:50:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 53 [2024-11-13 23:50:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645870682] [2024-11-13 23:50:32,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:50:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 23:50:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 23:50:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=3967, Unknown=41, NotChecked=966, Total=5550 [2024-11-13 23:50:32,534 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand has 54 states, 47 states have (on average 3.595744680851064) internal successors, (169), 48 states have internal predecessors, (169), 15 states have call successors, (48), 11 states have call predecessors, (48), 15 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2024-11-13 23:50:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:50:56,405 INFO L93 Difference]: Finished difference Result 962 states and 1377 transitions. [2024-11-13 23:50:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 23:50:56,406 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 47 states have (on average 3.595744680851064) internal successors, (169), 48 states have internal predecessors, (169), 15 states have call successors, (48), 11 states have call predecessors, (48), 15 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) Word has length 151 [2024-11-13 23:50:56,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:50:56,410 INFO L225 Difference]: With dead ends: 962 [2024-11-13 23:50:56,410 INFO L226 Difference]: Without dead ends: 688 [2024-11-13 23:50:56,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3223 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=1468, Invalid=8619, Unknown=41, NotChecked=1428, Total=11556 [2024-11-13 23:50:56,415 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 780 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 5132 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 5367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 5132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:50:56,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2225 Invalid, 5367 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [235 Valid, 5132 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-11-13 23:50:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-13 23:50:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 470. [2024-11-13 23:50:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 402 states have (on average 1.4029850746268657) internal successors, (564), 404 states have internal predecessors, (564), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:50:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 672 transitions. [2024-11-13 23:50:56,484 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 672 transitions. Word has length 151 [2024-11-13 23:50:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:50:56,485 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 672 transitions. [2024-11-13 23:50:56,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 47 states have (on average 3.595744680851064) internal successors, (169), 48 states have internal predecessors, (169), 15 states have call successors, (48), 11 states have call predecessors, (48), 15 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2024-11-13 23:50:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 672 transitions. [2024-11-13 23:50:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:50:56,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:50:56,488 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:50:56,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-13 23:50:56,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:50:56,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 23:50:57,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:50:57,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:50:57,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:50:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1419872950, now seen corresponding path program 1 times [2024-11-13 23:50:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:50:57,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310128979] [2024-11-13 23:50:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:50:57,090 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-13 23:50:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:50:57,092 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:50:57,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-13 23:50:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:50:57,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 23:50:57,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:50:58,103 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-13 23:50:58,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 23:50:58,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 23:50:58,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-11-13 23:50:58,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:58,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 52 [2024-11-13 23:50:58,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2024-11-13 23:50:59,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:59,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 30 [2024-11-13 23:50:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-13 23:50:59,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:50:59,314 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:50:59,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310128979] [2024-11-13 23:50:59,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310128979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:50:59,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:50:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 23:50:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987617060] [2024-11-13 23:50:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:50:59,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:50:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:59,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:50:59,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:50:59,316 INFO L87 Difference]: Start difference. First operand 470 states and 672 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 23:51:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:05,333 INFO L93 Difference]: Finished difference Result 879 states and 1261 transitions. [2024-11-13 23:51:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:51:05,335 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-13 23:51:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:05,339 INFO L225 Difference]: With dead ends: 879 [2024-11-13 23:51:05,339 INFO L226 Difference]: Without dead ends: 605 [2024-11-13 23:51:05,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-13 23:51:05,341 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 305 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:05,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 805 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-13 23:51:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-13 23:51:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 489. [2024-11-13 23:51:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 421 states have (on average 1.4133016627078385) internal successors, (595), 423 states have internal predecessors, (595), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:51:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 703 transitions. [2024-11-13 23:51:05,418 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 703 transitions. Word has length 151 [2024-11-13 23:51:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 703 transitions. [2024-11-13 23:51:05,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 23:51:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 703 transitions. [2024-11-13 23:51:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:51:05,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:05,428 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:51:05,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-13 23:51:05,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:51:05,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:05,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:05,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1678038388, now seen corresponding path program 1 times [2024-11-13 23:51:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223808408] [2024-11-13 23:51:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:05,630 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-13 23:51:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:05,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:51:05,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:51:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:06,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 23:51:06,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:06,650 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-13 23:51:06,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-13 23:51:07,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:07,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-13 23:51:07,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:07,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-13 23:51:08,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:08,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 58 [2024-11-13 23:51:08,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:08,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 61 [2024-11-13 23:51:08,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2024-11-13 23:51:09,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:09,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 35 [2024-11-13 23:51:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-13 23:51:09,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:09,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_527) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) is different from false [2024-11-13 23:51:09,666 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223808408] [2024-11-13 23:51:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223808408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:51:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2072814295] [2024-11-13 23:51:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:51:09,669 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:51:09,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-13 23:51:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:10,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 23:51:10,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:11,239 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-13 23:51:11,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-13 23:51:13,030 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 41 treesize of output 28 [2024-11-13 23:51:13,444 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 36 [2024-11-13 23:51:14,784 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 58 treesize of output 55 [2024-11-13 23:51:15,110 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 66 treesize of output 59 [2024-11-13 23:51:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-13 23:51:15,854 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 67 treesize of output 39 [2024-11-13 23:51:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 427 proven. 27 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-13 23:51:15,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:15,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_563) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) is different from false [2024-11-13 23:51:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2072814295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:51:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710742213] [2024-11-13 23:51:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:16,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:51:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:51:16,297 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:51:16,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 23:51:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:16,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 23:51:16,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:17,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-13 23:51:17,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2024-11-13 23:51:18,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:18,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-11-13 23:51:19,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:19,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 75 [2024-11-13 23:51:20,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:20,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 78 [2024-11-13 23:51:20,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 64 [2024-11-13 23:51:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 372 proven. 27 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-13 23:51:21,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710742213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:51:21,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:51:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 44 [2024-11-13 23:51:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486321284] [2024-11-13 23:51:21,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:51:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 23:51:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 23:51:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=2155, Unknown=16, NotChecked=198, Total=2756 [2024-11-13 23:51:21,556 INFO L87 Difference]: Start difference. First operand 489 states and 703 transitions. Second operand has 45 states, 40 states have (on average 4.325) internal successors, (173), 41 states have internal predecessors, (173), 16 states have call successors, (44), 11 states have call predecessors, (44), 16 states have return successors, (44), 14 states have call predecessors, (44), 16 states have call successors, (44) [2024-11-13 23:51:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:43,416 INFO L93 Difference]: Finished difference Result 945 states and 1351 transitions. [2024-11-13 23:51:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 23:51:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 4.325) internal successors, (173), 41 states have internal predecessors, (173), 16 states have call successors, (44), 11 states have call predecessors, (44), 16 states have return successors, (44), 14 states have call predecessors, (44), 16 states have call successors, (44) Word has length 151 [2024-11-13 23:51:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:43,422 INFO L225 Difference]: With dead ends: 945 [2024-11-13 23:51:43,422 INFO L226 Difference]: Without dead ends: 650 [2024-11-13 23:51:43,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 485 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=936, Invalid=4308, Unknown=20, NotChecked=286, Total=5550 [2024-11-13 23:51:43,425 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1057 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 3889 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 4229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 3889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:43,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1894 Invalid, 4229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 3889 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2024-11-13 23:51:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-13 23:51:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 509. [2024-11-13 23:51:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 440 states have (on average 1.415909090909091) internal successors, (623), 442 states have internal predecessors, (623), 54 states have call successors, (54), 14 states have call predecessors, (54), 14 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:51:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 731 transitions. [2024-11-13 23:51:43,508 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 731 transitions. Word has length 151 [2024-11-13 23:51:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:43,509 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 731 transitions. [2024-11-13 23:51:43,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 4.325) internal successors, (173), 41 states have internal predecessors, (173), 16 states have call successors, (44), 11 states have call predecessors, (44), 16 states have return successors, (44), 14 states have call predecessors, (44), 16 states have call successors, (44) [2024-11-13 23:51:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 731 transitions. [2024-11-13 23:51:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:51:43,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:43,512 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:51:43,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-13 23:51:43,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-13 23:51:43,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:51:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:51:44,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 104641036, now seen corresponding path program 1 times [2024-11-13 23:51:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180990699] [2024-11-13 23:51:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:44,115 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-13 23:51:44,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:44,120 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:51:44,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-13 23:51:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:44,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 23:51:44,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:44,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:51:46,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 27 treesize of output 20 [2024-11-13 23:51:46,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:51:47,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-13 23:51:48,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-13 23:51:50,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:50,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 84 [2024-11-13 23:51:50,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:50,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 87 [2024-11-13 23:51:51,107 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 107 treesize of output 91 [2024-11-13 23:51:51,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:51,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 61 [2024-11-13 23:51:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 454 proven. 48 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-13 23:51:51,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:52,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_630 (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_630)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_632))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:51:52,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_630 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_630)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_632))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:51:53,106 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180990699] [2024-11-13 23:51:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180990699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:51:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136007598] [2024-11-13 23:51:53,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:51:53,109 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:51:53,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-13 23:51:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:53,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 23:51:54,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:55,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:51:55,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:51:56,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:51:56,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 13 [2024-11-13 23:51:57,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2024-11-13 23:51:58,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2024-11-13 23:51:59,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 58 [2024-11-13 23:51:59,414 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 62 treesize of output 52 [2024-11-13 23:51:59,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2024-11-13 23:52:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 418 proven. 27 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-13 23:52:01,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:52:01,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_670))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:52:01,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (_ BitVec 32)) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_668)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_670))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:52:01,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (_ BitVec 32)) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_668)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_670))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:52:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [136007598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:52:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075542005] [2024-11-13 23:52:01,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:52:01,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:52:01,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:52:01,652 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:52:01,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 23:52:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:52:01,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 23:52:01,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:52:02,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:52:04,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:52:04,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 27 treesize of output 20 [2024-11-13 23:52:04,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:52:05,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-13 23:52:07,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:07,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2024-11-13 23:52:07,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:07,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 69 [2024-11-13 23:52:08,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 79 treesize of output 67 [2024-11-13 23:52:08,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:08,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 43 [2024-11-13 23:52:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 434 proven. 48 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-13 23:52:10,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:52:10,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_707))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:52:10,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_706)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_707))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:52:10,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_706)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_707))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-13 23:52:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075542005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:52:11,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:52:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 20] total 57 [2024-11-13 23:52:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873508427] [2024-11-13 23:52:11,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:52:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-13 23:52:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:52:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-13 23:52:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=3605, Unknown=35, NotChecked=1064, Total=5256 [2024-11-13 23:52:11,996 INFO L87 Difference]: Start difference. First operand 509 states and 731 transitions. Second operand has 58 states, 50 states have (on average 3.92) internal successors, (196), 52 states have internal predecessors, (196), 18 states have call successors, (57), 12 states have call predecessors, (57), 18 states have return successors, (57), 15 states have call predecessors, (57), 18 states have call successors, (57) [2024-11-13 23:52:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:52:50,278 INFO L93 Difference]: Finished difference Result 1102 states and 1561 transitions. [2024-11-13 23:52:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-13 23:52:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 50 states have (on average 3.92) internal successors, (196), 52 states have internal predecessors, (196), 18 states have call successors, (57), 12 states have call predecessors, (57), 18 states have return successors, (57), 15 states have call predecessors, (57), 18 states have call successors, (57) Word has length 151 [2024-11-13 23:52:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:52:50,285 INFO L225 Difference]: With dead ends: 1102 [2024-11-13 23:52:50,286 INFO L226 Difference]: Without dead ends: 787 [2024-11-13 23:52:50,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 469 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 5310 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=2327, Invalid=13917, Unknown=44, NotChecked=2072, Total=18360 [2024-11-13 23:52:50,292 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2012 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 5864 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 6479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 5864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:52:50,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 2391 Invalid, 6479 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [615 Valid, 5864 Invalid, 0 Unknown, 0 Unchecked, 27.1s Time] [2024-11-13 23:52:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-13 23:52:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 511. [2024-11-13 23:52:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 441 states have (on average 1.4104308390022675) internal successors, (622), 443 states have internal predecessors, (622), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:52:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 730 transitions. [2024-11-13 23:52:50,386 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 730 transitions. Word has length 151 [2024-11-13 23:52:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:52:50,386 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 730 transitions. [2024-11-13 23:52:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 50 states have (on average 3.92) internal successors, (196), 52 states have internal predecessors, (196), 18 states have call successors, (57), 12 states have call predecessors, (57), 18 states have return successors, (57), 15 states have call predecessors, (57), 18 states have call successors, (57) [2024-11-13 23:52:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 730 transitions. [2024-11-13 23:52:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:52:50,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:52:50,389 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:52:50,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-13 23:52:50,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-13 23:52:50,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 23:52:50,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:52:50,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:52:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:52:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash -906476214, now seen corresponding path program 1 times [2024-11-13 23:52:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:52:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641719760] [2024-11-13 23:52:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:52:50,995 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-13 23:52:50,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:52:50,996 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:52:50,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:52:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:52:51,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 23:52:51,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:52:52,384 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-13 23:52:52,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 23:52:52,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-13 23:52:53,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-13 23:52:53,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:53,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2024-11-13 23:52:53,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:53,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 62 [2024-11-13 23:52:53,990 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 55 treesize of output 47 [2024-11-13 23:52:54,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:54,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 37 [2024-11-13 23:52:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-13 23:52:54,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:52:54,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:52:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641719760] [2024-11-13 23:52:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641719760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:52:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:52:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 23:52:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74019616] [2024-11-13 23:52:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:52:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 23:52:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:52:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 23:52:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:52:54,860 INFO L87 Difference]: Start difference. First operand 511 states and 730 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 23:53:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:53:01,743 INFO L93 Difference]: Finished difference Result 893 states and 1276 transitions. [2024-11-13 23:53:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 23:53:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2024-11-13 23:53:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:53:01,748 INFO L225 Difference]: With dead ends: 893 [2024-11-13 23:53:01,748 INFO L226 Difference]: Without dead ends: 574 [2024-11-13 23:53:01,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-13 23:53:01,750 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 433 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:53:01,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 816 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-13 23:53:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-13 23:53:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 511. [2024-11-13 23:53:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 441 states have (on average 1.4104308390022675) internal successors, (622), 443 states have internal predecessors, (622), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:53:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 730 transitions. [2024-11-13 23:53:01,855 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 730 transitions. Word has length 151 [2024-11-13 23:53:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:53:01,856 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 730 transitions. [2024-11-13 23:53:01,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 23:53:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 730 transitions. [2024-11-13 23:53:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:53:01,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:53:01,858 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:01,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:53:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:53:02,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:53:02,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:53:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash -507762166, now seen corresponding path program 1 times [2024-11-13 23:53:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:53:02,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188347162] [2024-11-13 23:53:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:53:02,060 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-13 23:53:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:53:02,063 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:53:02,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-13 23:53:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:53:02,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 23:53:02,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:53:03,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:53:04,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:53:05,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2024-11-13 23:53:05,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2024-11-13 23:53:06,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2024-11-13 23:53:06,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:06,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 52 [2024-11-13 23:53:06,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 65 treesize of output 55 [2024-11-13 23:53:07,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:07,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 41 [2024-11-13 23:53:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 438 proven. 54 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 23:53:08,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:53:08,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-13 23:53:08,709 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))))))) is different from false [2024-11-13 23:53:08,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |c_ULTIMATE.start_step_#t~ite29#1| |c_ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))))) is different from false [2024-11-13 23:53:08,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse3))) |c_ULTIMATE.start_step_#t~ite24#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse3))))))))))) is different from false [2024-11-13 23:53:09,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:53:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188347162] [2024-11-13 23:53:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188347162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:53:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [99309552] [2024-11-13 23:53:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:53:09,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:53:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:53:09,341 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:53:09,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-13 23:53:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:53:10,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 23:53:10,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:53:11,381 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-13 23:53:13,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 23:53:13,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-13 23:53:15,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-13 23:53:16,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-13 23:53:17,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2024-11-13 23:53:18,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2024-11-13 23:53:18,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-11-13 23:53:19,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2024-11-13 23:53:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 473 proven. 54 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-13 23:53:20,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:53:21,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))))))) is different from false [2024-11-13 23:53:21,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))))))) is different from false [2024-11-13 23:53:21,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |c_ULTIMATE.start_step_#t~ite29#1| |c_ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2)))))))) is different from false [2024-11-13 23:53:21,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) |c_ULTIMATE.start_step_#t~ite24#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse3)))))))) is different from false [2024-11-13 23:53:21,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse3))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse3))))))))))) is different from false [2024-11-13 23:53:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [99309552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:53:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006691020] [2024-11-13 23:53:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:53:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:53:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:53:21,330 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:53:21,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 23:53:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:53:21,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 23:53:21,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:53:21,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:53:23,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 12 treesize of output 8 [2024-11-13 23:53:26,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 23:53:26,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 23:53:28,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-11-13 23:53:29,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:29,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2024-11-13 23:53:32,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:32,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 70 [2024-11-13 23:53:32,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:32,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 73 [2024-11-13 23:53:33,443 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 83 treesize of output 71 [2024-11-13 23:53:35,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:35,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 53 [2024-11-13 23:53:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 426 proven. 99 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-13 23:53:35,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:53:36,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-13 23:53:36,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |c_ULTIMATE.start_step_#t~ite29#1| |c_ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))))))) is different from false [2024-11-13 23:53:36,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) |c_ULTIMATE.start_step_#t~ite24#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse3)))))))) is different from false [2024-11-13 23:53:36,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse3)))))))) is different from false [2024-11-13 23:53:37,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0)) (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse6 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse6 .cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse6 .cse4))) .cse1))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse3 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse4)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse5)))))))))) is different from false [2024-11-13 23:53:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006691020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:53:37,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:53:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 30] total 73 [2024-11-13 23:53:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757828253] [2024-11-13 23:53:37,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:53:37,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-13 23:53:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:53:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-13 23:53:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=5907, Unknown=110, NotChecked=2422, Total=9120 [2024-11-13 23:53:37,071 INFO L87 Difference]: Start difference. First operand 511 states and 730 transitions. Second operand has 74 states, 65 states have (on average 3.230769230769231) internal successors, (210), 67 states have internal predecessors, (210), 20 states have call successors, (57), 16 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 20 states have call successors, (57) [2024-11-13 23:54:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:54:22,825 INFO L93 Difference]: Finished difference Result 1109 states and 1561 transitions. [2024-11-13 23:54:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-13 23:54:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 65 states have (on average 3.230769230769231) internal successors, (210), 67 states have internal predecessors, (210), 20 states have call successors, (57), 16 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 20 states have call successors, (57) Word has length 151 [2024-11-13 23:54:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:54:22,830 INFO L225 Difference]: With dead ends: 1109 [2024-11-13 23:54:22,830 INFO L226 Difference]: Without dead ends: 790 [2024-11-13 23:54:22,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 446 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 8333 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=3010, Invalid=21680, Unknown=172, NotChecked=4550, Total=29412 [2024-11-13 23:54:22,837 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1419 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 7186 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 7591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 7186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:54:22,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3348 Invalid, 7591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [405 Valid, 7186 Invalid, 0 Unknown, 0 Unchecked, 26.7s Time] [2024-11-13 23:54:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-13 23:54:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 515. [2024-11-13 23:54:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 444 states have (on average 1.4076576576576576) internal successors, (625), 446 states have internal predecessors, (625), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:54:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 733 transitions. [2024-11-13 23:54:22,985 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 733 transitions. Word has length 151 [2024-11-13 23:54:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:54:22,986 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 733 transitions. [2024-11-13 23:54:22,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 65 states have (on average 3.230769230769231) internal successors, (210), 67 states have internal predecessors, (210), 20 states have call successors, (57), 16 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 20 states have call successors, (57) [2024-11-13 23:54:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 733 transitions. [2024-11-13 23:54:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:54:22,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:54:22,989 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:54:22,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-13 23:54:23,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-13 23:54:23,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-13 23:54:23,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:54:23,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:54:23,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:54:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 458532737, now seen corresponding path program 1 times [2024-11-13 23:54:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:54:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290125656] [2024-11-13 23:54:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:23,592 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-13 23:54:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:54:23,595 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:54:23,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:54:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:23,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:54:23,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 23:54:24,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:54:24,000 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:54:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290125656] [2024-11-13 23:54:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290125656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:54:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:54:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:54:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715828667] [2024-11-13 23:54:24,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:54:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:54:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:54:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:54:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:54:24,002 INFO L87 Difference]: Start difference. First operand 515 states and 733 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:54:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:54:24,114 INFO L93 Difference]: Finished difference Result 847 states and 1209 transitions. [2024-11-13 23:54:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:54:24,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 23:54:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:54:24,118 INFO L225 Difference]: With dead ends: 847 [2024-11-13 23:54:24,118 INFO L226 Difference]: Without dead ends: 524 [2024-11-13 23:54:24,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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-13 23:54:24,119 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 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-13 23:54:24,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:54:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-13 23:54:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2024-11-13 23:54:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 455 states have internal predecessors, (634), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:54:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 742 transitions. [2024-11-13 23:54:24,267 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 742 transitions. Word has length 151 [2024-11-13 23:54:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:54:24,268 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 742 transitions. [2024-11-13 23:54:24,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:54:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 742 transitions. [2024-11-13 23:54:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:54:24,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:54:24,270 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:54:24,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:54:24,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:54:24,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:54:24,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:54:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash -405078762, now seen corresponding path program 1 times [2024-11-13 23:54:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:54:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287620988] [2024-11-13 23:54:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:24,472 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-13 23:54:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:54:24,474 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:54:24,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-13 23:54:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:25,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 23:54:25,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:25,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:54:27,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:54:27,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:54:27,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-13 23:54:28,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-13 23:54:31,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:54:31,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 69 [2024-11-13 23:54:31,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:54:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 69 [2024-11-13 23:54:31,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 82 [2024-11-13 23:54:32,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:54:32,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 63 [2024-11-13 23:54:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 464 proven. 42 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-13 23:54:32,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:54:33,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_917))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse2))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-13 23:54:33,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_916 (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_916)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_917))) (let ((.cse2 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-13 23:54:33,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_913 (_ BitVec 32)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_916 (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_913) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_916)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_917))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse2))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-13 23:54:34,907 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:54:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287620988] [2024-11-13 23:54:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287620988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:54:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [87780981] [2024-11-13 23:54:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:34,907 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:54:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:54:34,909 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:54:34,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-13 23:54:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:35,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 23:54:35,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:36,095 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-13 23:54:37,722 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-13 23:54:38,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 23:54:41,590 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-13 23:54:41,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 65 [2024-11-13 23:54:42,184 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-13 23:54:42,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 95 [2024-11-13 23:54:43,131 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 23:54:43,131 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 146 treesize of output 130 [2024-11-13 23:54:43,251 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 34 treesize of output 30 [2024-11-13 23:54:45,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:54:45,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 282 treesize of output 250 [2024-11-13 23:54:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 257 proven. 6 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-13 23:54:46,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:54:47,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_952))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-13 23:54:47,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_950 (_ BitVec 32)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_950)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_952))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-13 23:54:47,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_950 (_ BitVec 32)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_949 (_ BitVec 32))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_949) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_950)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_952))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse3))) (not (bvsgt .cse3 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-13 23:54:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [87780981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:54:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128715587] [2024-11-13 23:54:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:54:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:54:54,608 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:54:54,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-13 23:54:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:54,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 23:54:54,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:55,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:54:58,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 25 [2024-11-13 23:55:16,441 WARN L286 SmtUtils]: Spent 13.36s on a formula simplification. DAG size of input: 36 DAG size of output: 15 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:55:16,441 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2024-11-13 23:55:16,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 71 [2024-11-13 23:55:47,658 WARN L286 SmtUtils]: Spent 30.23s on a formula simplification. DAG size of input: 36 DAG size of output: 27 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:55:47,658 INFO L349 Elim1Store]: treesize reduction 17, result has 75.7 percent of original size [2024-11-13 23:55:47,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 151 [2024-11-13 23:56:01,823 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 23:56:01,823 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 180 treesize of output 168 [2024-11-13 23:56:02,249 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 33 treesize of output 29 [2024-11-13 23:56:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-13 23:56:16,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:56:17,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_985))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))))))) is different from false [2024-11-13 23:56:18,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_983 (_ BitVec 32)) (v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_983)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_985))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-13 23:56:18,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_983 (_ BitVec 32)) (v_ArrVal_981 (_ BitVec 32)) (v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_981) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_983)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_985))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))) (.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (bvslt .cse0 (bvadd (bvneg .cse1) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))) (not (bvsgt .cse1 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse0) .cse3)))))))) is different from false [2024-11-13 23:56:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128715587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:56:20,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:56:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 69 [2024-11-13 23:56:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711980767] [2024-11-13 23:56:20,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:56:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-13 23:56:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:56:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-13 23:56:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=6821, Unknown=25, NotChecked=1602, Total=9120 [2024-11-13 23:56:20,426 INFO L87 Difference]: Start difference. First operand 524 states and 742 transitions. Second operand has 70 states, 62 states have (on average 3.096774193548387) internal successors, (192), 63 states have internal predecessors, (192), 17 states have call successors, (57), 13 states have call predecessors, (57), 17 states have return successors, (57), 13 states have call predecessors, (57), 17 states have call successors, (57) [2024-11-13 23:57:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:57:01,724 INFO L93 Difference]: Finished difference Result 1036 states and 1460 transitions. [2024-11-13 23:57:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 23:57:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 62 states have (on average 3.096774193548387) internal successors, (192), 63 states have internal predecessors, (192), 17 states have call successors, (57), 13 states have call predecessors, (57), 17 states have return successors, (57), 13 states have call predecessors, (57), 17 states have call successors, (57) Word has length 151 [2024-11-13 23:57:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:57:01,728 INFO L225 Difference]: With dead ends: 1036 [2024-11-13 23:57:01,728 INFO L226 Difference]: Without dead ends: 704 [2024-11-13 23:57:01,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 444 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5257 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=1888, Invalid=14125, Unknown=25, NotChecked=2322, Total=18360 [2024-11-13 23:57:01,732 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1819 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 4911 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 5394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 4911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:57:01,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 2192 Invalid, 5394 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [483 Valid, 4911 Invalid, 0 Unknown, 0 Unchecked, 26.6s Time] [2024-11-13 23:57:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-13 23:57:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 547. [2024-11-13 23:57:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 477 states have internal predecessors, (667), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:57:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 775 transitions. [2024-11-13 23:57:01,853 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 775 transitions. Word has length 151 [2024-11-13 23:57:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:57:01,854 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 775 transitions. [2024-11-13 23:57:01,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 62 states have (on average 3.096774193548387) internal successors, (192), 63 states have internal predecessors, (192), 17 states have call successors, (57), 13 states have call predecessors, (57), 17 states have return successors, (57), 13 states have call predecessors, (57), 17 states have call successors, (57) [2024-11-13 23:57:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 775 transitions. [2024-11-13 23:57:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:57:01,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:57:01,857 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:01,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-13 23:57:02,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-13 23:57:02,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-13 23:57:02,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:57:02,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:57:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:57:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1684942440, now seen corresponding path program 1 times [2024-11-13 23:57:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:57:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098539201] [2024-11-13 23:57:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:57:02,459 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-13 23:57:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:57:02,461 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:57:02,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:57:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:57:02,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:57:02,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:57:02,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:57:02,953 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 41 treesize of output 17 [2024-11-13 23:57:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 23:57:03,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:57:03,051 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:57:03,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098539201] [2024-11-13 23:57:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098539201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:57:03,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:57:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:57:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851876589] [2024-11-13 23:57:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:57:03,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:57:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:57:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:57:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:57:03,053 INFO L87 Difference]: Start difference. First operand 547 states and 775 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:57:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:57:04,673 INFO L93 Difference]: Finished difference Result 990 states and 1404 transitions. [2024-11-13 23:57:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:57:04,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 23:57:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:57:04,677 INFO L225 Difference]: With dead ends: 990 [2024-11-13 23:57:04,677 INFO L226 Difference]: Without dead ends: 658 [2024-11-13 23:57:04,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:57:04,678 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 46 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:57:04,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 512 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 23:57:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-13 23:57:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 554. [2024-11-13 23:57:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 482 states have (on average 1.4066390041493777) internal successors, (678), 484 states have internal predecessors, (678), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:57:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 786 transitions. [2024-11-13 23:57:04,818 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 786 transitions. Word has length 151 [2024-11-13 23:57:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:57:04,819 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 786 transitions. [2024-11-13 23:57:04,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 23:57:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 786 transitions. [2024-11-13 23:57:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:57:04,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:57:04,821 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:04,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:57:05,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:57:05,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:57:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:57:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2023218842, now seen corresponding path program 1 times [2024-11-13 23:57:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:57:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72097153] [2024-11-13 23:57:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:57:05,023 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-13 23:57:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:57:05,025 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:57:05,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-13 23:57:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:57:05,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 23:57:05,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:57:05,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:57:07,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:57:08,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 27 treesize of output 20 [2024-11-13 23:57:09,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-13 23:57:10,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2024-11-13 23:57:13,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:57:13,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 75 [2024-11-13 23:57:13,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:57:13,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 78 [2024-11-13 23:57:13,771 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 75 treesize of output 65 [2024-11-13 23:57:15,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:57:15,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 61 [2024-11-13 23:57:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 462 proven. 48 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-13 23:57:17,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:57:18,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1049))) (let ((.cse2 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) (or (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse1) (= ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))))))))) is different from false [2024-11-13 23:57:19,051 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (_ BitVec 32)) (v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1047)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1049))) (let ((.cse1 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse0)))))) is different from false [2024-11-13 23:57:19,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (_ BitVec 32)) (v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2 ((_ sign_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_step_#t~ite19#1|))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1047)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1049))) (let ((.cse1 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse0))))))) is different from false [2024-11-13 23:57:21,172 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:57:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72097153] [2024-11-13 23:57:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72097153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:57:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254153995] [2024-11-13 23:57:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:57:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:57:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:57:21,174 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:57:21,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-13 23:57:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:57:21,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 23:57:21,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:57:22,320 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-13 23:57:24,259 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-13 23:57:26,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 23:57:28,557 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 42 treesize of output 29 [2024-11-13 23:57:30,995 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 51 treesize of output 41 [2024-11-13 23:57:36,061 INFO L349 Elim1Store]: treesize reduction 69, result has 17.9 percent of original size [2024-11-13 23:57:36,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 90 [2024-11-13 23:57:37,616 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2024-11-13 23:57:37,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 99 [2024-11-13 23:57:38,783 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 23:57:38,783 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 127 treesize of output 111 [2024-11-13 23:57:38,928 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 25 treesize of output 21 [2024-11-13 23:57:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 440 proven. 21 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-13 23:57:41,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:57:44,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1088))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse3))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) .cse3)))))) is different from false [2024-11-13 23:57:53,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1254153995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:57:53,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708566294] [2024-11-13 23:57:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:57:53,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:57:53,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:57:53,162 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:57:53,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-13 23:57:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:57:53,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 23:57:53,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:57:53,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:57:57,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-13 23:58:01,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:01,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-11-13 23:58:05,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:05,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2024-11-13 23:58:12,650 INFO L349 Elim1Store]: treesize reduction 77, result has 18.1 percent of original size [2024-11-13 23:58:12,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 98 treesize of output 103 [2024-11-13 23:58:14,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:14,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 88 [2024-11-13 23:58:15,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 82 [2024-11-13 23:58:17,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:17,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 57 [2024-11-13 23:58:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 375 proven. 27 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-13 23:58:18,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:58:19,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1124) |c_~#unsigned_char_Array_0~0.base|))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2024-11-13 23:58:28,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708566294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:58:28,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:58:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 26] total 86 [2024-11-13 23:58:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478016704] [2024-11-13 23:58:28,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:58:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-13 23:58:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:58:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-13 23:58:28,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1048, Invalid=12456, Unknown=88, NotChecked=1170, Total=14762 [2024-11-13 23:58:28,147 INFO L87 Difference]: Start difference. First operand 554 states and 786 transitions. Second operand has 87 states, 76 states have (on average 2.8684210526315788) internal successors, (218), 81 states have internal predecessors, (218), 24 states have call successors, (57), 15 states have call predecessors, (57), 24 states have return successors, (57), 18 states have call predecessors, (57), 24 states have call successors, (57) [2024-11-13 23:59:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:59:52,215 INFO L93 Difference]: Finished difference Result 1311 states and 1841 transitions. [2024-11-13 23:59:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-13 23:59:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 76 states have (on average 2.8684210526315788) internal successors, (218), 81 states have internal predecessors, (218), 24 states have call successors, (57), 15 states have call predecessors, (57), 24 states have return successors, (57), 18 states have call predecessors, (57), 24 states have call successors, (57) Word has length 151 [2024-11-13 23:59:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:59:52,221 INFO L225 Difference]: With dead ends: 1311 [2024-11-13 23:59:52,221 INFO L226 Difference]: Without dead ends: 971 [2024-11-13 23:59:52,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 421 SyntacticMatches, 2 SemanticMatches, 191 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 10556 ImplicationChecksByTransitivity, 93.6s TimeCoverageRelationStatistics Valid=3972, Invalid=31116, Unknown=88, NotChecked=1880, Total=37056 [2024-11-13 23:59:52,226 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 3492 mSDsluCounter, 3841 mSDsCounter, 0 mSdLazyCounter, 8013 mSolverCounterSat, 647 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3492 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 8661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 8013 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:59:52,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3492 Valid, 3972 Invalid, 8661 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [647 Valid, 8013 Invalid, 1 Unknown, 0 Unchecked, 49.0s Time] [2024-11-13 23:59:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-13 23:59:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 570. [2024-11-13 23:59:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 498 states have (on average 1.4096385542168675) internal successors, (702), 500 states have internal predecessors, (702), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 23:59:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 810 transitions. [2024-11-13 23:59:52,361 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 810 transitions. Word has length 151 [2024-11-13 23:59:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:59:52,362 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 810 transitions. [2024-11-13 23:59:52,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 76 states have (on average 2.8684210526315788) internal successors, (218), 81 states have internal predecessors, (218), 24 states have call successors, (57), 15 states have call predecessors, (57), 24 states have return successors, (57), 18 states have call predecessors, (57), 24 states have call successors, (57) [2024-11-13 23:59:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 810 transitions. [2024-11-13 23:59:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 23:59:52,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:59:52,366 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:52,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-13 23:59:52,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-13 23:59:52,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-13 23:59:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:59:52,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:59:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:59:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1025318998, now seen corresponding path program 1 times [2024-11-13 23:59:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:59:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124271159] [2024-11-13 23:59:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:59:52,968 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-13 23:59:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:59:52,970 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:59:52,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-13 23:59:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:59:53,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 23:59:53,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:59:53,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 23:59:55,086 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-13 23:59:56,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:59:56,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 23:59:56,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-13 23:59:57,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2024-11-14 00:00:00,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:00,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 68 [2024-11-14 00:00:00,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:00,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 68 [2024-11-14 00:00:00,852 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 89 treesize of output 77 [2024-11-14 00:00:01,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:01,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 56 [2024-11-14 00:00:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 444 proven. 42 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-14 00:00:02,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 00:00:02,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1163))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))))))))) is different from false [2024-11-14 00:00:02,657 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1161 (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1161)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1163))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))))))))) is different from false [2024-11-14 00:00:02,699 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (_ BitVec 32)) (v_ArrVal_1161 (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_1159) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1161)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1163))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))))))) is different from false [2024-11-14 00:00:04,110 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 00:00:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124271159] [2024-11-14 00:00:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124271159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 00:00:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [529234098] [2024-11-14 00:00:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:00:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 00:00:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 00:00:04,113 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 00:00:04,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-14 00:00:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:00:04,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 00:00:04,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:00:05,320 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 00:00:07,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 00:00:09,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-14 00:00:13,875 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-14 00:00:13,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 72 [2024-11-14 00:00:14,881 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-14 00:00:14,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 103 [2024-11-14 00:00:16,616 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 00:00:16,617 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 175 treesize of output 161 [2024-11-14 00:00:16,820 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 32 treesize of output 28 [2024-11-14 00:00:21,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:21,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 323 treesize of output 295 [2024-11-14 00:00:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-14 00:00:53,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 00:00:55,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (not (bvslt .cse1 (bvadd (bvneg .cse2) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-14 00:00:55,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (_ BitVec 32))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1197)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (not (bvslt .cse2 (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))))))))) is different from false [2024-11-14 00:00:55,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32)) (v_ArrVal_1197 (_ BitVec 32))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_1195) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1197)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (not (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse3)))) (not (bvsgt .cse3 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-14 00:01:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [529234098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 00:01:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876480673] [2024-11-14 00:01:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:01:00,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 00:01:00,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 00:01:00,703 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 00:01:00,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b6fa49-6576-4076-b095-16c0e46bb1b0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 00:01:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:01:01,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 00:01:01,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:01:01,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 00:01:05,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 25 [2024-11-14 00:01:15,425 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-14 00:01:15,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 90 [2024-11-14 00:02:02,684 WARN L286 SmtUtils]: Spent 46.32s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 00:02:02,684 INFO L349 Elim1Store]: treesize reduction 17, result has 79.8 percent of original size [2024-11-14 00:02:02,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 139 [2024-11-14 00:02:12,338 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 00:02:12,339 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 179 treesize of output 163 [2024-11-14 00:02:12,629 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 34 treesize of output 30