./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje --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 e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:02:32,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:02:33,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:02:33,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:02:33,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:02:33,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:02:33,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:02:33,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:02:33,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:02:33,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:02:33,131 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:02:33,132 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:02:33,132 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:02:33,133 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:02:33,133 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:02:33,134 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:02:33,134 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:02:33,135 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:02:33,135 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:02:33,136 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:02:33,136 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:02:33,139 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:02:33,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:02:33,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:02:33,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:02:33,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:02:33,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:02:33,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:02:33,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:02:33,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:02:33,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:02:33,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:02:33,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:02:33,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:02:33,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:02:33,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:02:33,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:02:33,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:02:33,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:02:33,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:02:33,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:02:33,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:02:33,151 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:02:33,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:02:33,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:02:33,152 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:02:33,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:02:33,152 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje 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 -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-11-09 06:02:33,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:02:33,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:02:33,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:02:33,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:02:33,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:02:33,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i Unable to find full path for "g++" [2024-11-09 06:02:35,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:02:35,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:02:35,901 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-09 06:02:35,916 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data/69cd186db/6ea433a1734b4303979c38274c0cd770/FLAG333e97f28 [2024-11-09 06:02:36,232 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data/69cd186db/6ea433a1734b4303979c38274c0cd770 [2024-11-09 06:02:36,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:02:36,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:02:36,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:02:36,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:02:36,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:02:36,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d67f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36, skipping insertion in model container [2024-11-09 06:02:36,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:02:36,551 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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-09 06:02:36,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:02:36,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:02:36,662 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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-09 06:02:36,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:02:36,747 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:02:36,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36 WrapperNode [2024-11-09 06:02:36,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:02:36,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:02:36,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:02:36,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:02:36,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,859 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-09 06:02:36,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:02:36,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:02:36,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:02:36,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:02:36,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:02:36,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:02:36,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:02:36,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:02:36,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (1/1) ... [2024-11-09 06:02:36,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:02:37,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:37,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:02:37,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:02:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:02:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:02:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 06:02:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 06:02:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:02:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 06:02:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:02:37,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:02:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:02:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:02:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:02:37,265 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:02:37,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:02:38,103 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-09 06:02:38,104 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:02:38,855 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:02:38,856 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:02:38,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:38 BoogieIcfgContainer [2024-11-09 06:02:38,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:02:38,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:02:38,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:02:38,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:02:38,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:02:36" (1/3) ... [2024-11-09 06:02:38,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f46a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:38, skipping insertion in model container [2024-11-09 06:02:38,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:36" (2/3) ... [2024-11-09 06:02:38,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f46a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:38, skipping insertion in model container [2024-11-09 06:02:38,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:38" (3/3) ... [2024-11-09 06:02:38,869 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-11-09 06:02:38,893 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:02:38,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:02:38,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:02:38,995 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;@1fa4f7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:02:38,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:02:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 06:02:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 06:02:39,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:39,013 INFO L215 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:02:39,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:02:39,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1608381721, now seen corresponding path program 1 times [2024-11-09 06:02:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694753785] [2024-11-09 06:02:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:02:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920228148] [2024-11-09 06:02:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:40,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:40,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:40,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:40,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:02:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:02:41,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:02:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:02:42,029 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:02:42,032 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:02:42,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 06:02:42,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:02:42,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 06:02:42,241 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 06:02:42,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:02:42,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:02:42 BoogieIcfgContainer [2024-11-09 06:02:42,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:02:42,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:02:42,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:02:42,370 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:02:42,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:38" (3/4) ... [2024-11-09 06:02:42,377 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:02:42,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:02:42,380 INFO L158 Benchmark]: Toolchain (without parser) took 6142.28ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 147.6MB in the beginning and 160.7MB in the end (delta: -13.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-11-09 06:02:42,381 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:02:42,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.29ms. Allocated memory is still 184.5MB. Free memory was 147.0MB in the beginning and 140.9MB in the end (delta: 6.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:02:42,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.24ms. Allocated memory is still 184.5MB. Free memory was 140.9MB in the beginning and 137.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:02:42,383 INFO L158 Benchmark]: Boogie Preprocessor took 110.86ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 132.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:02:42,384 INFO L158 Benchmark]: RCFGBuilder took 1883.96ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 128.8MB in the end (delta: 4.1MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-11-09 06:02:42,385 INFO L158 Benchmark]: TraceAbstraction took 3508.62ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 127.9MB in the beginning and 160.7MB in the end (delta: -32.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-09 06:02:42,386 INFO L158 Benchmark]: Witness Printer took 9.64ms. Allocated memory is still 239.1MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:02:42,393 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.29ms. Allocated memory is still 184.5MB. Free memory was 147.0MB in the beginning and 140.9MB in the end (delta: 6.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.24ms. Allocated memory is still 184.5MB. Free memory was 140.9MB in the beginning and 137.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.86ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 132.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1883.96ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 128.8MB in the end (delta: 4.1MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3508.62ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 127.9MB in the beginning and 160.7MB in the end (delta: -32.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 9.64ms. Allocated memory is still 239.1MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of shiftLeft at line 62, overapproximation of someUnaryFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 50 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 16 }; [L40] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 16; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR unsigned_long_int_Array_0[0] [L99] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] float_Array_0[0][0] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L82] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F [L82] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] float_Array_0[1][0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[1][0] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L84] EXPR float_Array_0[1][0] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L84] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] float_Array_0[0][1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[0][1] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L86] EXPR float_Array_0[0][1] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L86] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] signed_long_int_Array_0[1][0] = __VERIFIER_nondet_long() [L91] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(signed_long_int_Array_0[1][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L110] RET updateVariables() [L111] CALL step() [L44] EXPR float_Array_0[0][1] [L44] EXPR float_Array_0[1][0] [L44] COND FALSE !(float_Array_0[0][1] <= (- float_Array_0[1][0])) [L47] BOOL_unsigned_char_Array_0[1] [L47] COND TRUE BOOL_unsigned_char_Array_0[1] [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][1] = float_Array_0[0][0] [L53] EXPR unsigned_char_Array_0[0] [L53] signed_short_int_Array_0[0] = unsigned_char_Array_0[0] [L54] EXPR BOOL_unsigned_char_Array_0[0] [L54] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L55] EXPR BOOL_unsigned_char_Array_0[1] [L55] COND TRUE BOOL_unsigned_char_Array_0[1] || stepLocal_0 [L56] EXPR signed_short_int_Array_0[0] [L56] EXPR signed_short_int_Array_0[0] [L56] EXPR ((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) [L56] EXPR signed_short_int_Array_0[0] [L56] EXPR ((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) [L56] signed_long_int_Array_0[1][1] = ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))) [L60] EXPR signed_long_int_Array_0[1][0] [L60] signed long int stepLocal_3 = signed_long_int_Array_0[1][0]; [L61] EXPR signed_short_int_Array_0[0] [L61] EXPR signed_long_int_Array_0[1][0] [L61] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]; [L62] EXPR signed_long_int_Array_0[1][0] [L62] EXPR signed_short_int_Array_0[0] [L62] EXPR signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0] [L62] signed long int stepLocal_1 = signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]; [L63] EXPR signed_long_int_Array_0[0][0] [L63] EXPR ((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]) [L63] EXPR signed_long_int_Array_0[0][0] [L63] EXPR ((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]) [L63] COND TRUE stepLocal_1 != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]))) [L64] EXPR signed_short_int_Array_0[0] [L64] EXPR unsigned_char_Array_0[0] [L64] COND TRUE (signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= stepLocal_3 [L65] EXPR signed_short_int_Array_0[0] [L65] COND FALSE !(stepLocal_2 > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) [L68] EXPR signed_long_int_Array_0[0][0] [L68] unsigned_long_int_Array_0[0] = signed_long_int_Array_0[0][0] [L72] EXPR signed_short_int_Array_0[0] [L72] signed_long_int_Array_0[0][1] = signed_short_int_Array_0[0] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR float_Array_0[0][1] [L102] EXPR float_Array_0[1][0] [L102] EXPR (float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0]))) [L102] EXPR BOOL_unsigned_char_Array_0[1] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])) [L102] EXPR float_Array_0[1][1] [L102] EXPR float_Array_0[0][0] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])) [L102] EXPR (float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0]))) [L102] EXPR ((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4)))) [L102] EXPR (((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1) [L102] EXPR ((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0])) [L102] EXPR (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) [L102-L103] return (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 1, TraceHistogramMax: 14, 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=37occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 06:02:42,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje --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 e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:02:45,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:02:45,245 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:02:45,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:02:45,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:02:45,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:02:45,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:02:45,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:02:45,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:02:45,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:02:45,281 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:02:45,281 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:02:45,282 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:02:45,282 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:02:45,283 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:02:45,283 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:02:45,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:02:45,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:02:45,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:02:45,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:02:45,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:02:45,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:02:45,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:02:45,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:02:45,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:02:45,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:02:45,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:02:45,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:02:45,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:02:45,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:02:45,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:02:45,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:02:45,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:02:45,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:02:45,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:02:45,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:02:45,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:02:45,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:02:45,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:02:45,292 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:02:45,293 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:02:45,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:02:45,293 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:02:45,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje 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 -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-11-09 06:02:45,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:02:45,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:02:45,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:02:45,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:02:45,803 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:02:45,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i Unable to find full path for "g++" [2024-11-09 06:02:47,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:02:48,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:02:48,288 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-09 06:02:48,299 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data/dc8103b69/8d88b4e3287d417da4826edcc9136778/FLAG7256a0ecb [2024-11-09 06:02:48,317 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/data/dc8103b69/8d88b4e3287d417da4826edcc9136778 [2024-11-09 06:02:48,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:02:48,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:02:48,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:02:48,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:02:48,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:02:48,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:48" (1/1) ... [2024-11-09 06:02:48,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d2a4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:48, skipping insertion in model container [2024-11-09 06:02:48,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:48" (1/1) ... [2024-11-09 06:02:48,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:02:48,654 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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-09 06:02:48,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:02:48,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:02:48,907 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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-09 06:02:49,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:02:49,046 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:02:49,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49 WrapperNode [2024-11-09 06:02:49,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:02:49,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:02:49,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:02:49,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:02:49,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,161 INFO L138 Inliner]: procedures = 36, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-09 06:02:49,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:02:49,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:02:49,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:02:49,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:02:49,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:02:49,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:02:49,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:02:49,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:02:49,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (1/1) ... [2024-11-09 06:02:49,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:02:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:49,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:02:49,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:02:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:02:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 06:02:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-09 06:02:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:02:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 06:02:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-09 06:02:49,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 06:02:49,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-09 06:02:49,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-09 06:02:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-09 06:02:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:02:49,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:02:49,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:02:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:02:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 06:02:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-09 06:02:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 06:02:49,527 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:02:49,532 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:02:50,445 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-09 06:02:50,445 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:02:50,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:02:50,473 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:02:50,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:50 BoogieIcfgContainer [2024-11-09 06:02:50,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:02:50,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:02:50,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:02:50,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:02:50,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:02:48" (1/3) ... [2024-11-09 06:02:50,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b828db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:50, skipping insertion in model container [2024-11-09 06:02:50,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:49" (2/3) ... [2024-11-09 06:02:50,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b828db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:50, skipping insertion in model container [2024-11-09 06:02:50,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:50" (3/3) ... [2024-11-09 06:02:50,488 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-11-09 06:02:50,511 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:02:50,512 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:02:50,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:02:50,626 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;@2ca96c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:02:50,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:02:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.430232558139535) internal successors, (123), 87 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 06:02:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:02:50,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:50,655 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:02:50,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:02:50,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1214986204, now seen corresponding path program 1 times [2024-11-09 06:02:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:02:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223843032] [2024-11-09 06:02:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:50,686 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-09 06:02:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:02:50,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:50,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:51,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 06:02:51,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-09 06:02:51,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:02:51,231 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:02:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223843032] [2024-11-09 06:02:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223843032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:51,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:51,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:02:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878822651] [2024-11-09 06:02:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:02:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:02:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:02:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:02:51,278 INFO L87 Difference]: Start difference. First operand has 103 states, 86 states have (on average 1.430232558139535) internal successors, (123), 87 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:02:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:51,333 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-09 06:02:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:02:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 06:02:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:51,350 INFO L225 Difference]: With dead ends: 199 [2024-11-09 06:02:51,350 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 06:02:51,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:02:51,370 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:51,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:02:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 06:02:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 06:02:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 06:02:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-09 06:02:51,452 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 123 [2024-11-09 06:02:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-09 06:02:51,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:02:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-09 06:02:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:02:51,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:51,461 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:02:51,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 06:02:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:51,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:02:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1444435436, now seen corresponding path program 1 times [2024-11-09 06:02:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:02:51,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21655911] [2024-11-09 06:02:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:51,666 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-09 06:02:51,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:02:51,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:51,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:52,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:02:52,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 06:02:52,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:02:52,178 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:02:52,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21655911] [2024-11-09 06:02:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21655911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:52,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:52,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:02:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100276102] [2024-11-09 06:02:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:52,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:02:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:02:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:02:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:52,187 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:02:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:52,298 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2024-11-09 06:02:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:02:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 06:02:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:52,301 INFO L225 Difference]: With dead ends: 200 [2024-11-09 06:02:52,301 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 06:02:52,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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-09 06:02:52,316 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:52,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:02:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 06:02:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-09 06:02:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 06:02:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-09 06:02:52,343 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 123 [2024-11-09 06:02:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:52,345 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-09 06:02:52,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:02:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-09 06:02:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:02:52,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:52,354 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:02:52,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:02:52,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:52,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:02:52,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1075524498, now seen corresponding path program 1 times [2024-11-09 06:02:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:02:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285024635] [2024-11-09 06:02:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:52,567 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-09 06:02:52,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:02:52,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:52,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 06:02:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:52,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:02:52,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 06:02:53,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:02:53,031 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:02:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285024635] [2024-11-09 06:02:53,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285024635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:53,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:02:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392591786] [2024-11-09 06:02:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:02:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:02:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:02:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:53,037 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:02:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:53,142 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2024-11-09 06:02:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:02:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 06:02:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:53,145 INFO L225 Difference]: With dead ends: 206 [2024-11-09 06:02:53,148 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 06:02:53,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:53,151 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:53,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 669 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:02:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 06:02:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-09 06:02:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 06:02:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-11-09 06:02:53,185 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 123 [2024-11-09 06:02:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:53,186 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-11-09 06:02:53,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:02:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-11-09 06:02:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:02:53,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:53,191 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:02:53,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:02:53,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:53,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:02:53,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1073677456, now seen corresponding path program 1 times [2024-11-09 06:02:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:02:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792345490] [2024-11-09 06:02:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:53,401 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-09 06:02:53,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:02:53,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:53,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:02:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:53,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 06:02:53,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:54,545 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-09 06:02:55,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:02:55,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:02:55,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 20 treesize of output 15 [2024-11-09 06:02:56,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:02:56,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:02:57,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:02:57,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:02:57,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:02:57,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:02:57,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:02:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 100 proven. 153 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 06:02:58,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:02:58,235 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_105) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_107) |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))) is different from false [2024-11-09 06:02:58,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:02:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792345490] [2024-11-09 06:02:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792345490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1598614026] [2024-11-09 06:02:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:58,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:02:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:02:58,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:02:58,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 06:02:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:59,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:02:59,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:59,787 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-09 06:03:00,063 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-09 06:03:00,302 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-09 06:03:00,511 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-09 06:03:00,734 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-09 06:03:01,039 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-09 06:03:01,280 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-09 06:03:01,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:03:01,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 19 treesize of output 14 [2024-11-09 06:03:01,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:03:01,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:03:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-09 06:03:01,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:01,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_143) |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))) is different from false [2024-11-09 06:03:01,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_141) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_143) |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))) is different from false [2024-11-09 06:03:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1598614026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875799901] [2024-11-09 06:03:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:02,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:02,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:02,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:02,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:03:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:02,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:03:02,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:03,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:03:03,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:03:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 06:03:03,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:03:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875799901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:03:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 8] total 16 [2024-11-09 06:03:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429011195] [2024-11-09 06:03:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:03,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:03:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:03:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:03:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=326, Unknown=15, NotChecked=120, Total=552 [2024-11-09 06:03:03,191 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:03:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:04,240 INFO L93 Difference]: Finished difference Result 261 states and 370 transitions. [2024-11-09 06:03:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:03:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 06:03:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:04,243 INFO L225 Difference]: With dead ends: 261 [2024-11-09 06:03:04,243 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 06:03:04,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=360, Unknown=15, NotChecked=126, Total=600 [2024-11-09 06:03:04,246 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 193 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:04,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 312 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:03:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 06:03:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-09 06:03:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 137 states have internal predecessors, (186), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:03:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 218 transitions. [2024-11-09 06:03:04,264 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 218 transitions. Word has length 123 [2024-11-09 06:03:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:04,264 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 218 transitions. [2024-11-09 06:03:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:03:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2024-11-09 06:03:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:03:04,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:04,268 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:03:04,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:03:04,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-09 06:03:04,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:04,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:04,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:03:04,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2084794706, now seen corresponding path program 1 times [2024-11-09 06:03:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:03:04,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095326276] [2024-11-09 06:03:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:04,876 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-09 06:03:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:03:04,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:04,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:05,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 06:03:05,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:06,238 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-09 06:03:06,547 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 27 treesize of output 11 [2024-11-09 06:03:06,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:03:07,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:03:07,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:03:07,214 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 27 treesize of output 11 [2024-11-09 06:03:07,223 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 15 treesize of output 7 [2024-11-09 06:03:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 141 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 06:03:07,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:07,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_199 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (select (select (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_198) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_199) |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) (_ bv0 32))) is different from false [2024-11-09 06:03:07,402 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:03:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095326276] [2024-11-09 06:03:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095326276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2072552193] [2024-11-09 06:03:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:07,403 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:03:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:03:07,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:03:07,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 06:03:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:08,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 06:03:08,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:09,782 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-09 06:03:10,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:03:11,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:12,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:12,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 105 treesize of output 78 [2024-11-09 06:03:13,439 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 139 treesize of output 67 [2024-11-09 06:03:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 276 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 06:03:13,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:13,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_232) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2072552193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823099572] [2024-11-09 06:03:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:13,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:13,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:03:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:14,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 06:03:14,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:15,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 06:03:17,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:17,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:18,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 129 treesize of output 102 [2024-11-09 06:03:19,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:19,015 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 175 treesize of output 67 [2024-11-09 06:03:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 276 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 06:03:19,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823099572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:19,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:03:19,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2024-11-09 06:03:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112216549] [2024-11-09 06:03:19,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:03:19,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 06:03:19,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:03:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 06:03:19,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1316, Unknown=29, NotChecked=150, Total=1640 [2024-11-09 06:03:19,743 INFO L87 Difference]: Start difference. First operand 155 states and 218 transitions. Second operand has 34 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 14 states have call successors, (42), 13 states have call predecessors, (42), 14 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) [2024-11-09 06:03:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:33,336 INFO L93 Difference]: Finished difference Result 579 states and 801 transitions. [2024-11-09 06:03:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 06:03:33,339 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 14 states have call successors, (42), 13 states have call predecessors, (42), 14 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) Word has length 123 [2024-11-09 06:03:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:33,344 INFO L225 Difference]: With dead ends: 579 [2024-11-09 06:03:33,344 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 06:03:33,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=885, Invalid=5567, Unknown=36, NotChecked=318, Total=6806 [2024-11-09 06:03:33,349 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1082 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 251 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:33,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 944 Invalid, 2470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2218 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-11-09 06:03:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 06:03:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 203. [2024-11-09 06:03:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 171 states have internal predecessors, (222), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 06:03:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 276 transitions. [2024-11-09 06:03:33,390 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 276 transitions. Word has length 123 [2024-11-09 06:03:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 276 transitions. [2024-11-09 06:03:33,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 14 states have call successors, (42), 13 states have call predecessors, (42), 14 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) [2024-11-09 06:03:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 276 transitions. [2024-11-09 06:03:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:03:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:33,395 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:03:33,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-09 06:03:33,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:33,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:03:33,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:33,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:03:33,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1556108050, now seen corresponding path program 1 times [2024-11-09 06:03:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:03:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801328038] [2024-11-09 06:03:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:33,997 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-09 06:03:33,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:03:34,001 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:34,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:34,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:03:34,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 06:03:34,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:03:34,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:03:34,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801328038] [2024-11-09 06:03:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801328038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:34,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:03:34,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165992741] [2024-11-09 06:03:34,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:34,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:03:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:34,341 INFO L87 Difference]: Start difference. First operand 203 states and 276 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:03:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:34,395 INFO L93 Difference]: Finished difference Result 405 states and 552 transitions. [2024-11-09 06:03:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 06:03:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:34,399 INFO L225 Difference]: With dead ends: 405 [2024-11-09 06:03:34,399 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 06:03:34,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:34,401 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:34,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:03:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 06:03:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 06:03:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 171 states have (on average 1.304093567251462) internal successors, (223), 173 states have internal predecessors, (223), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 06:03:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-09 06:03:34,428 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 123 [2024-11-09 06:03:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:34,429 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-09 06:03:34,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:03:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-09 06:03:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 06:03:34,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:34,432 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:03:34,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:34,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:34,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:03:34,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1897255630, now seen corresponding path program 1 times [2024-11-09 06:03:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:03:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449615972] [2024-11-09 06:03:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:34,634 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-09 06:03:34,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:03:34,635 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:34,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:34,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:03:34,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 06:03:34,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:03:34,903 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:03:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449615972] [2024-11-09 06:03:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449615972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:34,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:03:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953531244] [2024-11-09 06:03:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:34,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:03:34,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:34,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:34,905 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:03:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:34,971 INFO L93 Difference]: Finished difference Result 407 states and 551 transitions. [2024-11-09 06:03:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:34,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 06:03:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:34,974 INFO L225 Difference]: With dead ends: 407 [2024-11-09 06:03:34,974 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 06:03:34,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:34,976 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:34,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:03:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 06:03:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 06:03:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 173 states have internal predecessors, (222), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 06:03:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 276 transitions. [2024-11-09 06:03:35,001 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 276 transitions. Word has length 123 [2024-11-09 06:03:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:35,001 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 276 transitions. [2024-11-09 06:03:35,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:03:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 276 transitions. [2024-11-09 06:03:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:03:35,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:35,004 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:03:35,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:35,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:35,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:03:35,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash 351412732, now seen corresponding path program 1 times [2024-11-09 06:03:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:03:35,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792071780] [2024-11-09 06:03:35,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:35,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:03:35,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:03:35,207 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:03:35,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 06:03:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:35,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 06:03:35,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:36,372 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-09 06:03:37,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 06:03:38,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:38,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:39,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:40,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:40,351 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 140 treesize of output 67 [2024-11-09 06:03:40,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:40,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:40,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:40,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:40,790 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 175 treesize of output 67 [2024-11-09 06:03:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:03:40,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:41,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_341) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_343) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:41,408 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_81| (_ BitVec 32)) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_81|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_341) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_343) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:41,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:03:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792071780] [2024-11-09 06:03:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792071780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [808271298] [2024-11-09 06:03:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:03:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:03:41,463 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:03:41,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-09 06:03:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:43,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 06:03:43,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:44,279 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-09 06:03:45,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:03:46,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:47,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:47,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:48,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 63 [2024-11-09 06:03:48,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 105 treesize of output 78 [2024-11-09 06:03:48,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:49,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:03:49,293 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 139 treesize of output 67 [2024-11-09 06:03:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:03:49,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:49,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_376) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:49,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_374) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_376) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:49,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_89| (_ BitVec 32))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_89|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_374) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_376) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:49,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [808271298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:49,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355974651] [2024-11-09 06:03:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:49,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:49,589 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:49,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 06:03:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:49,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 06:03:49,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 06:03:52,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:53,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:53,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:03:55,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:55,586 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 163 treesize of output 85 [2024-11-09 06:03:55,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:03:55,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:03:56,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:03:56,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 78 [2024-11-09 06:03:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 140 proven. 132 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:03:56,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:56,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:56,485 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_406) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:56,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_96| (_ BitVec 32)) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_96|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_406) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_408) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:03:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355974651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:57,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:03:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 34 [2024-11-09 06:03:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439069352] [2024-11-09 06:03:57,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:03:57,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 06:03:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:03:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 06:03:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1362, Unknown=18, NotChecked=664, Total=2256 [2024-11-09 06:03:57,062 INFO L87 Difference]: Start difference. First operand 205 states and 276 transitions. Second operand has 35 states, 35 states have (on average 4.142857142857143) internal successors, (145), 34 states have internal predecessors, (145), 10 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-11-09 06:04:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:05,808 INFO L93 Difference]: Finished difference Result 703 states and 957 transitions. [2024-11-09 06:04:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:04:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.142857142857143) internal successors, (145), 34 states have internal predecessors, (145), 10 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) Word has length 124 [2024-11-09 06:04:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:05,815 INFO L225 Difference]: With dead ends: 703 [2024-11-09 06:04:05,816 INFO L226 Difference]: Without dead ends: 501 [2024-11-09 06:04:05,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 404 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=380, Invalid=1986, Unknown=18, NotChecked=808, Total=3192 [2024-11-09 06:04:05,818 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1238 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 169 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:05,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 997 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1980 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-11-09 06:04:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-09 06:04:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 225. [2024-11-09 06:04:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 193 states have internal predecessors, (249), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 06:04:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 303 transitions. [2024-11-09 06:04:05,850 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 303 transitions. Word has length 124 [2024-11-09 06:04:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:05,851 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 303 transitions. [2024-11-09 06:04:05,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.142857142857143) internal successors, (145), 34 states have internal predecessors, (145), 10 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-11-09 06:04:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 303 transitions. [2024-11-09 06:04:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:04:05,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:05,854 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:04:05,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 06:04:06,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 06:04:06,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-09 06:04:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:04:06,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:04:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash -719814315, now seen corresponding path program 1 times [2024-11-09 06:04:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:04:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316487397] [2024-11-09 06:04:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:06,456 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-09 06:04:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:04:06,457 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:04:06,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:04:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:06,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:04:06,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:04:07,213 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-09 06:04:07,332 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-09 06:04:07,448 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-09 06:04:07,602 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-09 06:04:07,793 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-09 06:04:07,973 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-09 06:04:08,368 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 89 treesize of output 53 [2024-11-09 06:04:08,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2024-11-09 06:04:08,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2024-11-09 06:04:08,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2024-11-09 06:04:08,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:08,778 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 119 treesize of output 47 [2024-11-09 06:04:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-09 06:04:08,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:04:09,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_442) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_444) |c_~#float_Array_0~0.base|))) (let ((.cse2 (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse2)) (not (fp.lt .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))))) is different from false [2024-11-09 06:04:09,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_103| (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) .cse2 |v_skolemized_q#valueAsBitvector_103|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_442) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_444) |c_~#float_Array_0~0.base|))) (let ((.cse3 (let ((.cse4 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (= |c_ULTIMATE.start_step_#t~ite9#1| (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_103|)))) (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse3)) (not (fp.lt .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))))) is different from false [2024-11-09 06:04:10,158 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:04:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316487397] [2024-11-09 06:04:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316487397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1577980503] [2024-11-09 06:04:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:10,159 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:04:10,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:04:10,160 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:04:10,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 06:04:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:11,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 06:04:11,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:04:12,691 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-09 06:04:13,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:04:14,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:04:14,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:04:15,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:04:15,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:04:16,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 60 [2024-11-09 06:04:17,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:04:17,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:04:17,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:04:17,923 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 155 treesize of output 71 [2024-11-09 06:04:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 112 proven. 132 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 06:04:45,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:04:45,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_481) |c_~#float_Array_0~0.base|))) (let ((.cse2 (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse2)) (not (fp.lt .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))))) is different from false [2024-11-09 06:04:45,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_479) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_481) |c_~#float_Array_0~0.base|))) (let ((.cse2 (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse2)) (not (fp.lt .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))))) is different from false [2024-11-09 06:04:45,703 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 32)) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) .cse2 |v_skolemized_q#valueAsBitvector_110|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_479) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_481) |c_~#float_Array_0~0.base|))) (let ((.cse3 (let ((.cse4 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse3)) (not (= |c_ULTIMATE.start_step_#t~ite9#1| (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_110|)))) (not (fp.lt .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))))) is different from false [2024-11-09 06:04:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1577980503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714607628] [2024-11-09 06:04:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:46,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:04:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:04:46,957 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:04:46,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 06:04:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:47,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 06:04:47,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:04:54,327 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 68 treesize of output 32 [2024-11-09 06:04:55,335 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 68 treesize of output 32 [2024-11-09 06:04:56,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:04:57,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:04:59,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:05:02,649 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 114 treesize of output 66 [2024-11-09 06:05:03,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:05:03,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:05:04,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:05:05,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:05,594 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 167 treesize of output 71 [2024-11-09 06:05:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 91 proven. 162 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 06:05:33,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:05:33,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_513) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_444) |c_~#float_Array_0~0.base|))) (let ((.cse2 (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (or (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse2)) (not (fp.lt .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))))) is different from false [2024-11-09 06:05:34,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 32)) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) .cse2 |v_skolemized_q#valueAsBitvector_117|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_513) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_444) |c_~#float_Array_0~0.base|))) (let ((.cse3 (let ((.cse4 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (= |c_ULTIMATE.start_step_#t~ite9#1| (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_117|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_117|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_117|)))) (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg .cse3)) (not (fp.lt .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))))) is different from false [2024-11-09 06:05:35,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714607628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:05:35,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:05:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 39 [2024-11-09 06:05:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545412078] [2024-11-09 06:05:35,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:05:35,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 06:05:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:05:35,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 06:05:35,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2135, Unknown=45, NotChecked=728, Total=3306 [2024-11-09 06:05:35,605 INFO L87 Difference]: Start difference. First operand 225 states and 303 transitions. Second operand has 40 states, 40 states have (on average 4.1) internal successors, (164), 39 states have internal predecessors, (164), 8 states have call successors, (42), 8 states have call predecessors, (42), 9 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-09 06:05:52,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:05:55,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:05:57,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:06:12,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:20,755 INFO L93 Difference]: Finished difference Result 879 states and 1186 transitions. [2024-11-09 06:06:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 06:06:20,756 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.1) internal successors, (164), 39 states have internal predecessors, (164), 8 states have call successors, (42), 8 states have call predecessors, (42), 9 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) Word has length 124 [2024-11-09 06:06:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:20,760 INFO L225 Difference]: With dead ends: 879 [2024-11-09 06:06:20,760 INFO L226 Difference]: Without dead ends: 657 [2024-11-09 06:06:20,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 396 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 78.5s TimeCoverageRelationStatistics Valid=837, Invalid=4257, Unknown=46, NotChecked=1022, Total=6162 [2024-11-09 06:06:20,764 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 824 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 66 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:20,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1473 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2688 Invalid, 3 Unknown, 0 Unchecked, 32.9s Time] [2024-11-09 06:06:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-09 06:06:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 361. [2024-11-09 06:06:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 304 states have internal predecessors, (384), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 06:06:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 480 transitions. [2024-11-09 06:06:20,820 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 480 transitions. Word has length 124 [2024-11-09 06:06:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:20,821 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 480 transitions. [2024-11-09 06:06:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.1) internal successors, (164), 39 states have internal predecessors, (164), 8 states have call successors, (42), 8 states have call predecessors, (42), 9 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-09 06:06:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 480 transitions. [2024-11-09 06:06:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:06:20,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:20,825 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:06:20,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-09 06:06:21,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:06:21,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 06:06:21,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:21,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 497557397, now seen corresponding path program 1 times [2024-11-09 06:06:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:06:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782204325] [2024-11-09 06:06:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:21,427 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-09 06:06:21,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:06:21,428 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:06:21,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:06:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:21,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:06:21,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 06:06:21,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:06:21,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:06:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782204325] [2024-11-09 06:06:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782204325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:06:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62403671] [2024-11-09 06:06:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:21,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:06:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:06:21,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:06:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:21,801 INFO L87 Difference]: Start difference. First operand 361 states and 480 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:06:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:22,009 INFO L93 Difference]: Finished difference Result 719 states and 957 transitions. [2024-11-09 06:06:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:06:22,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-11-09 06:06:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:22,013 INFO L225 Difference]: With dead ends: 719 [2024-11-09 06:06:22,013 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 06:06:22,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:22,015 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:22,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:06:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 06:06:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-11-09 06:06:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 301 states have (on average 1.2724252491694352) internal successors, (383), 304 states have internal predecessors, (383), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 06:06:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 479 transitions. [2024-11-09 06:06:22,060 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 479 transitions. Word has length 124 [2024-11-09 06:06:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:22,061 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 479 transitions. [2024-11-09 06:06:22,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 06:06:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 479 transitions. [2024-11-09 06:06:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 06:06:22,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:22,064 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:06:22,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:06:22,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:06:22,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -548239082, now seen corresponding path program 1 times [2024-11-09 06:06:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:06:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488146594] [2024-11-09 06:06:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:22,267 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-09 06:06:22,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:06:22,271 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:06:22,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 06:06:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:22,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 06:06:22,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:25,236 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-09 06:06:27,184 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 68 treesize of output 32 [2024-11-09 06:06:28,330 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 68 treesize of output 32 [2024-11-09 06:06:29,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 57 treesize of output 42 [2024-11-09 06:06:30,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:06:31,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 57 treesize of output 42 [2024-11-09 06:06:33,852 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 113 treesize of output 65 [2024-11-09 06:06:34,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2024-11-09 06:06:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2024-11-09 06:06:34,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2024-11-09 06:06:35,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:35,263 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 194 treesize of output 80 [2024-11-09 06:06:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 06:06:35,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:06:37,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_573) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_575) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-09 06:06:37,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_130| (_ BitVec 32)) (v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (not (= (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_130|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_130|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_130|)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 .cse4 |v_skolemized_q#valueAsBitvector_130|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_573) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_575) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse2 (select .cse3 .cse4))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (select .cse3 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))))) is different from false [2024-11-09 06:06:37,390 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:06:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488146594] [2024-11-09 06:06:37,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488146594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:06:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [166671116] [2024-11-09 06:06:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:06:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:06:37,394 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:06:37,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 06:06:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:39,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 06:06:39,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:42,820 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-09 06:06:45,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:06:47,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:06:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:06:49,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:06:51,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:06:53,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-09 06:06:54,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-09 06:06:54,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 96 treesize of output 69 [2024-11-09 06:06:55,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 96 treesize of output 69 [2024-11-09 06:06:55,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 80 [2024-11-09 06:06:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 06:06:55,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:06:56,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_612) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-09 06:06:56,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_610) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_612) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-09 06:06:56,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_137| (_ BitVec 32)) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (let ((.cse2 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse4 .cse2 |v_skolemized_q#valueAsBitvector_137|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_610) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_612) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_137|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_137|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_137|)) (let ((.cse5 (select .cse4 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from false [2024-11-09 06:06:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [166671116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:06:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109451701] [2024-11-09 06:06:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:56,396 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:06:56,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 06:06:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:56,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 06:06:56,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:01,204 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 68 treesize of output 32 [2024-11-09 06:07:02,433 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 68 treesize of output 32 [2024-11-09 06:07:03,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:07:04,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:07:06,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-09 06:07:07,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 113 treesize of output 65 [2024-11-09 06:07:07,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 102 treesize of output 75 [2024-11-09 06:07:08,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2024-11-09 06:07:08,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 102 treesize of output 75 [2024-11-09 06:07:08,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:08,661 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 194 treesize of output 80 [2024-11-09 06:07:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 06:07:08,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:08,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_647) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-09 06:07:09,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_645) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_647) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-09 06:07:09,073 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_144| (_ BitVec 32)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (not (= (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_144|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_144|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_144|)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 .cse4 |v_skolemized_q#valueAsBitvector_144|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_645) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_647) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse2 (select .cse3 .cse4))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (select .cse3 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))))) is different from false [2024-11-09 06:07:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109451701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:09,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:07:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 24 [2024-11-09 06:07:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704687484] [2024-11-09 06:07:09,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 06:07:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:07:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 06:07:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=709, Unknown=23, NotChecked=488, Total=1332 [2024-11-09 06:07:09,264 INFO L87 Difference]: Start difference. First operand 361 states and 479 transitions. Second operand has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 6 states have call successors, (28), 6 states have call predecessors, (28), 7 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-11-09 06:07:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:35,814 INFO L93 Difference]: Finished difference Result 948 states and 1261 transitions. [2024-11-09 06:07:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 06:07:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 6 states have call successors, (28), 6 states have call predecessors, (28), 7 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 125 [2024-11-09 06:07:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:35,819 INFO L225 Difference]: With dead ends: 948 [2024-11-09 06:07:35,820 INFO L226 Difference]: Without dead ends: 590 [2024-11-09 06:07:35,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=276, Invalid=1539, Unknown=23, NotChecked=712, Total=2550 [2024-11-09 06:07:35,823 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 563 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:35,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1213 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2024-11-09 06:07:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-09 06:07:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 384. [2024-11-09 06:07:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 324 states have (on average 1.2839506172839505) internal successors, (416), 327 states have internal predecessors, (416), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 06:07:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 512 transitions. [2024-11-09 06:07:35,885 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 512 transitions. Word has length 125 [2024-11-09 06:07:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:35,886 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 512 transitions. [2024-11-09 06:07:35,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 6 states have call successors, (28), 6 states have call predecessors, (28), 7 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-11-09 06:07:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 512 transitions. [2024-11-09 06:07:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 06:07:35,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:35,890 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:07:35,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 06:07:36,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 06:07:36,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 06:07:36,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:07:36,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:36,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1619466129, now seen corresponding path program 1 times [2024-11-09 06:07:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:07:36,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760061289] [2024-11-09 06:07:36,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:36,492 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-09 06:07:36,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:07:36,496 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:07:36,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:07:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:36,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 06:07:36,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:39,982 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-09 06:07:43,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-09 06:07:45,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:07:47,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:07:49,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:07:53,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:53,571 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 132 treesize of output 59 [2024-11-09 06:07:53,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-09 06:07:54,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-09 06:07:54,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-09 06:07:54,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:54,929 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 167 treesize of output 59 [2024-11-09 06:07:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:07:55,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:56,039 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_681) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:07:56,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_679) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_681) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:07:56,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (_ BitVec 32)) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_678)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_679) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_681) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:07:56,293 WARN L851 $PredicateComparison]: unable to prove that (or (fp.leq |c_ULTIMATE.start_step_#t~mem5#1| (fp.neg |c_ULTIMATE.start_step_#t~mem4#1|)) (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (_ BitVec 32)) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_678)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_679) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_681) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))))) is different from false [2024-11-09 06:07:56,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse5 (select |c_#memory_int| |c_~#float_Array_0~0.base|)) (.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|))) (or (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (_ BitVec 32)) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse5 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_678)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_679) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_681) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))))) (fp.leq (let ((.cse6 (select .cse5 .cse2))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (fp.neg (let ((.cse7 (select .cse5 .cse4))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))) is different from false [2024-11-09 06:07:56,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:07:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760061289] [2024-11-09 06:07:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760061289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [841308200] [2024-11-09 06:07:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:56,520 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:07:56,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:07:56,521 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:07:56,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-09 06:07:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:58,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 06:07:58,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:08:03,137 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-09 06:08:08,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-09 06:08:12,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:08:14,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:08:16,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:08:21,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 104 treesize of output 55 [2024-11-09 06:08:22,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:08:22,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:08:23,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:08:23,812 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 131 treesize of output 59 [2024-11-09 06:08:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:08:24,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:08:24,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_717) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:08:24,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_715) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_717) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:08:24,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_713)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_715) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_717) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:08:24,614 WARN L851 $PredicateComparison]: unable to prove that (or (fp.leq |c_ULTIMATE.start_step_#t~mem5#1| (fp.neg |c_ULTIMATE.start_step_#t~mem4#1|)) (forall ((v_ArrVal_713 (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_713)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_715) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_717) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))))) is different from false [2024-11-09 06:08:24,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (fp.leq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (forall ((v_ArrVal_713 (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse6 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_713)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_715) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_717) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse5 (select .cse6 .cse2))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.neg (let ((.cse7 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))))) is different from false [2024-11-09 06:08:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [841308200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:08:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521642012] [2024-11-09 06:08:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:08:24,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:08:24,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:08:24,827 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:08:24,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 06:08:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:08:25,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 06:08:25,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:08:35,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-09 06:08:39,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:08:41,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:08:44,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:08:49,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:08:49,822 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 132 treesize of output 59 [2024-11-09 06:08:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-09 06:08:50,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-09 06:08:51,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-09 06:08:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 125 proven. 147 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:08:53,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:08:56,960 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_748) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_750) |c_~#float_Array_0~0.base|))) (or (not (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (not (fp.lt (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2024-11-09 06:08:57,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_164| (_ BitVec 32))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_164|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_748) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_750) |c_~#float_Array_0~0.base|))) (or (not (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (not (fp.lt (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2024-11-09 06:08:57,157 WARN L851 $PredicateComparison]: unable to prove that (or (fp.leq |c_ULTIMATE.start_step_#t~mem5#1| (fp.neg |c_ULTIMATE.start_step_#t~mem4#1|)) (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_164| (_ BitVec 32))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_164|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_748) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_750) |c_~#float_Array_0~0.base|))) (or (not (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (not (fp.lt (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))))) is different from false [2024-11-09 06:08:57,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (fp.leq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_164| (_ BitVec 32))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_164|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_748) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_750) |c_~#float_Array_0~0.base|))) (or (not (fp.leq (let ((.cse5 (select .cse6 .cse2))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.neg (let ((.cse7 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))) (not (fp.lt (let ((.cse8 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))))) is different from false [2024-11-09 06:08:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521642012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:08:57,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:08:57,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 53 [2024-11-09 06:08:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239559903] [2024-11-09 06:08:57,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:08:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-09 06:08:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:08:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-09 06:08:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3207, Unknown=58, NotChecked=1806, Total=5402 [2024-11-09 06:08:57,488 INFO L87 Difference]: Start difference. First operand 384 states and 512 transitions. Second operand has 54 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 48 states have internal predecessors, (156), 11 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (37), 10 states have call predecessors, (37), 11 states have call successors, (37) [2024-11-09 06:09:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:44,406 INFO L93 Difference]: Finished difference Result 1570 states and 2096 transitions. [2024-11-09 06:09:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 06:09:44,408 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 48 states have internal predecessors, (156), 11 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (37), 10 states have call predecessors, (37), 11 states have call successors, (37) Word has length 125 [2024-11-09 06:09:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:44,416 INFO L225 Difference]: With dead ends: 1570 [2024-11-09 06:09:44,416 INFO L226 Difference]: Without dead ends: 1189 [2024-11-09 06:09:44,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=725, Invalid=5907, Unknown=66, NotChecked=2422, Total=9120 [2024-11-09 06:09:44,421 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1554 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:44,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 1723 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 35.3s Time] [2024-11-09 06:09:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-11-09 06:09:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 552. [2024-11-09 06:09:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 454 states have (on average 1.2687224669603525) internal successors, (576), 461 states have internal predecessors, (576), 76 states have call successors, (76), 21 states have call predecessors, (76), 21 states have return successors, (76), 69 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-09 06:09:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 728 transitions. [2024-11-09 06:09:44,532 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 728 transitions. Word has length 125 [2024-11-09 06:09:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:44,534 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 728 transitions. [2024-11-09 06:09:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 48 states have internal predecessors, (156), 11 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (37), 10 states have call predecessors, (37), 11 states have call successors, (37) [2024-11-09 06:09:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 728 transitions. [2024-11-09 06:09:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 06:09:44,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:44,539 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:09:44,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-09 06:09:44,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-09 06:09:44,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 06:09:45,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:09:45,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:45,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 796370221, now seen corresponding path program 1 times [2024-11-09 06:09:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:09:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775313494] [2024-11-09 06:09:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:45,142 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-09 06:09:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:09:45,146 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:09:45,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:09:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:45,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:09:45,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:09:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-09 06:09:45,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:09:45,745 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:09:45,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775313494] [2024-11-09 06:09:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775313494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:45,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:45,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:09:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928313419] [2024-11-09 06:09:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:45,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:09:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:09:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:09:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:09:45,748 INFO L87 Difference]: Start difference. First operand 552 states and 728 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 06:09:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:46,822 INFO L93 Difference]: Finished difference Result 1073 states and 1405 transitions. [2024-11-09 06:09:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:09:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-09 06:09:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:46,827 INFO L225 Difference]: With dead ends: 1073 [2024-11-09 06:09:46,827 INFO L226 Difference]: Without dead ends: 508 [2024-11-09 06:09:46,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:09:46,844 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:46,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 595 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:09:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-09 06:09:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 490. [2024-11-09 06:09:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 406 states have (on average 1.2610837438423645) internal successors, (512), 409 states have internal predecessors, (512), 64 states have call successors, (64), 19 states have call predecessors, (64), 19 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 06:09:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 640 transitions. [2024-11-09 06:09:46,919 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 640 transitions. Word has length 125 [2024-11-09 06:09:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:46,919 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 640 transitions. [2024-11-09 06:09:46,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 06:09:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 640 transitions. [2024-11-09 06:09:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 06:09:46,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:46,922 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:09:46,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:09:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:09:47,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1043157219, now seen corresponding path program 1 times [2024-11-09 06:09:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:09:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083037335] [2024-11-09 06:09:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:47,124 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-09 06:09:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:09:47,125 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:09:47,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:09:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:47,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 06:09:47,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:09:50,818 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-09 06:09:52,790 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 80 treesize of output 34 [2024-11-09 06:09:54,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 69 treesize of output 54 [2024-11-09 06:09:55,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-09 06:09:56,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2024-11-09 06:09:59,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:59,329 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 133 treesize of output 60 [2024-11-09 06:09:59,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2024-11-09 06:09:59,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2024-11-09 06:10:00,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2024-11-09 06:10:00,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:10:00,505 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 168 treesize of output 60 [2024-11-09 06:10:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 06:10:00,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:10:01,412 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_809) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:10:01,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_807) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_809) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:10:01,649 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_806 (_ BitVec 32))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_806)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_807) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_809) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:10:01,727 WARN L851 $PredicateComparison]: unable to prove that (or (fp.leq |c_ULTIMATE.start_step_#t~mem5#1| (fp.neg |c_ULTIMATE.start_step_#t~mem4#1|)) (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_806 (_ BitVec 32))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_806)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_807) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_809) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))))) is different from false [2024-11-09 06:10:01,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (fp.leq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_806 (_ BitVec 32))) (not (let ((.cse6 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_806)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_807) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_809) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse5 (select .cse6 .cse2))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.neg (let ((.cse7 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))))) is different from false [2024-11-09 06:10:01,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:10:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083037335] [2024-11-09 06:10:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083037335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:10:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [312362756] [2024-11-09 06:10:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:01,944 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:10:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:10:01,945 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:10:01,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 06:10:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:04,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 06:10:04,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:10:08,373 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-09 06:10:11,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:10:16,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:10:18,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:10:20,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:10:25,702 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 104 treesize of output 55 [2024-11-09 06:10:25,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:10:26,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-09 06:10:26,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 97 treesize of output 70 [2024-11-09 06:10:27,327 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 131 treesize of output 59 [2024-11-09 06:10:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 06:10:27,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:10:27,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_844) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:10:28,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_842) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_844) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:10:28,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_183| (_ BitVec 32)) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_183|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_842) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_844) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 06:10:28,264 WARN L851 $PredicateComparison]: unable to prove that (or (fp.leq |c_ULTIMATE.start_step_#t~mem5#1| (fp.neg |c_ULTIMATE.start_step_#t~mem4#1|)) (forall ((|v_skolemized_q#valueAsBitvector_183| (_ BitVec 32)) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_183|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_842) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_844) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))))) is different from false [2024-11-09 06:10:28,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse4 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (or (fp.leq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse3 (select .cse1 .cse4))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (forall ((|v_skolemized_q#valueAsBitvector_183| (_ BitVec 32)) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse6 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse1 (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) |v_skolemized_q#valueAsBitvector_183|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_842) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_844) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse5 (select .cse6 .cse2))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.neg (let ((.cse7 (select .cse6 .cse4))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))))) is different from false [2024-11-09 06:10:28,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [312362756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:10:28,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382044586] [2024-11-09 06:10:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:28,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:10:28,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:10:28,483 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:10:28,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 06:10:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:28,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:10:28,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:10:34,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:10:34,900 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 73 treesize of output 36 [2024-11-09 06:10:35,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 47 [2024-11-09 06:10:35,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 47 [2024-11-09 06:10:35,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 47 [2024-11-09 06:10:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 06:10:36,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:10:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382044586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:10:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:10:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 19] total 36 [2024-11-09 06:10:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843195104] [2024-11-09 06:10:36,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:10:36,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:10:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:10:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:10:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1301, Unknown=10, NotChecked=830, Total=2352 [2024-11-09 06:10:36,777 INFO L87 Difference]: Start difference. First operand 490 states and 640 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:10:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:10:42,208 INFO L93 Difference]: Finished difference Result 1070 states and 1403 transitions. [2024-11-09 06:10:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:10:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 06:10:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:10:42,214 INFO L225 Difference]: With dead ends: 1070 [2024-11-09 06:10:42,214 INFO L226 Difference]: Without dead ends: 583 [2024-11-09 06:10:42,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=220, Invalid=1370, Unknown=10, NotChecked=850, Total=2450 [2024-11-09 06:10:42,218 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 182 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:10:42,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 251 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 06:10:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-09 06:10:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 418. [2024-11-09 06:10:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 354 states have (on average 1.265536723163842) internal successors, (448), 357 states have internal predecessors, (448), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 06:10:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 544 transitions. [2024-11-09 06:10:42,284 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 544 transitions. Word has length 125 [2024-11-09 06:10:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:10:42,285 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 544 transitions. [2024-11-09 06:10:42,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:10:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 544 transitions. [2024-11-09 06:10:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 06:10:42,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:10:42,287 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:10:42,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 06:10:42,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 06:10:42,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-09 06:10:42,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:10:42,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:10:42,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:10:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1557645270, now seen corresponding path program 1 times [2024-11-09 06:10:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:10:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248004060] [2024-11-09 06:10:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:42,890 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-09 06:10:42,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:10:42,893 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:10:42,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:10:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:43,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 06:10:43,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:10:46,561 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-09 06:10:49,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-09 06:10:52,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:10:54,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:10:56,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-09 06:11:01,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:01,065 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 131 treesize of output 58 [2024-11-09 06:11:01,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-09 06:11:01,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-09 06:11:02,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-09 06:11:02,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:02,452 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 166 treesize of output 58 [2024-11-09 06:11:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:11:02,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:04,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_905) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_907) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:11:04,793 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (_ BitVec 32)) (v_ArrVal_905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_903)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_905) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_907) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:11:05,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:11:05,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248004060] [2024-11-09 06:11:05,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248004060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:05,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [334936609] [2024-11-09 06:11:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:11:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:11:05,857 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:11:05,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 06:11:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:08,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 06:11:08,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:12,799 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-09 06:11:18,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-09 06:11:22,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:11:24,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:11:27,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-09 06:11:32,586 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 103 treesize of output 54 [2024-11-09 06:11:32,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-09 06:11:33,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-09 06:11:34,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-09 06:11:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 58 [2024-11-09 06:11:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:11:35,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:35,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_942 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_942) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:11:35,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_942 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_940) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_942) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:11:35,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_938 (_ BitVec 32))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#float_Array_0~0.offset|) v_ArrVal_938)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_940) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_942) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:11:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [334936609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985049839] [2024-11-09 06:11:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:36,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:36,852 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:36,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 06:11:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:37,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:11:37,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:44,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:44,424 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 95 treesize of output 53 [2024-11-09 06:11:44,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 63 [2024-11-09 06:11:45,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 63 [2024-11-09 06:11:45,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 63 [2024-11-09 06:11:46,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:46,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 46 [2024-11-09 06:11:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 06:11:47,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985049839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:47,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:11:47,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 19] total 43 [2024-11-09 06:11:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638934407] [2024-11-09 06:11:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:47,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:11:47,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:11:47,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:11:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2118, Unknown=27, NotChecked=500, Total=2970 [2024-11-09 06:11:47,213 INFO L87 Difference]: Start difference. First operand 418 states and 544 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:11:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:53,192 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2024-11-09 06:11:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:11:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2024-11-09 06:11:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:53,196 INFO L225 Difference]: With dead ends: 896 [2024-11-09 06:11:53,197 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 06:11:53,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=338, Invalid=2205, Unknown=27, NotChecked=510, Total=3080 [2024-11-09 06:11:53,200 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 265 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:53,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 349 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 06:11:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 06:11:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 398. [2024-11-09 06:11:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 337 states have internal predecessors, (420), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 06:11:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 516 transitions. [2024-11-09 06:11:53,263 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 516 transitions. Word has length 126 [2024-11-09 06:11:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:53,264 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 516 transitions. [2024-11-09 06:11:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:11:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 516 transitions. [2024-11-09 06:11:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 06:11:53,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:53,266 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:11:53,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:53,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:53,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:53,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:11:53,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:53,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1774223095, now seen corresponding path program 1 times [2024-11-09 06:11:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:11:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309078497] [2024-11-09 06:11:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:53,869 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-09 06:11:53,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:11:53,870 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:11:53,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Waiting until timeout for monitored process [2024-11-09 06:11:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:54,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 06:11:54,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:56,300 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-09 06:11:58,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:11:59,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:00,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:01,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:03,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:04,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:07,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:07,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:12:07,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:08,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:08,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 100 proven. 153 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 06:12:08,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:08,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1008) |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))) is different from false [2024-11-09 06:12:09,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1008 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1005)) (.cse1 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1007) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1008) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1))) (not (= ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8)))))) is different from false [2024-11-09 06:12:10,103 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:12:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309078497] [2024-11-09 06:12:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309078497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1029718157] [2024-11-09 06:12:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:10,104 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:12:10,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:12:10,105 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:12:10,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-09 06:12:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:11,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 06:12:11,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:12,916 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-09 06:12:15,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:16,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:17,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:18,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 19 treesize of output 14 [2024-11-09 06:12:19,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:21,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:23,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:24,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 06:12:24,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 06:12:25,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 06:12:25,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 06:12:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 72 proven. 132 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-09 06:12:26,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:28,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1043)) (.cse1 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1045) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1046) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)))))) is different from false [2024-11-09 06:12:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1029718157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552171961] [2024-11-09 06:12:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:29,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:29,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:12:29,483 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:29,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 06:12:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:30,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:12:30,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:36,741 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-09 06:12:41,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-09 06:12:44,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-09 06:12:45,311 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 37 treesize of output 33 [2024-11-09 06:12:46,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-11-09 06:12:48,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 32 [2024-11-09 06:12:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 181 proven. 18 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-09 06:12:50,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:10,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|ULTIMATE.start_step_#t~mem33#1| (_ BitVec 8)) (|~#signed_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1079 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset|)))))))) (let ((.cse3 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse1 (select .cse3 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|))) (.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse3 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1079)) |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsge (bvsrem .cse0 ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem33#1|)) .cse1)) (not (bvugt (bvadd .cse1 .cse0) (bvmul .cse0 c_~last_1_unsigned_long_int_Array_0_0_~0)))))))) is different from false [2024-11-09 06:14:05,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|ULTIMATE.start_step_#t~mem33#1| (_ BitVec 8)) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1079 (_ BitVec 32))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_1076))) (store .cse4 |c_~#signed_short_int_Array_0~0.base| (store (select .cse4 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse4 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset|))))))))) (let ((.cse3 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse1 (select .cse3 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|))) (.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse3 (bvadd (_ bv12 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1079)) |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsge (bvsrem .cse0 ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem33#1|)) .cse1)) (not (bvugt (bvadd .cse1 .cse0) (bvmul .cse0 c_~last_1_unsigned_long_int_Array_0_0_~0)))))))) is different from false [2024-11-09 06:14:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552171961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:14:08,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:14:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 16] total 35 [2024-11-09 06:14:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280978633] [2024-11-09 06:14:08,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:14:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 06:14:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:14:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 06:14:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2072, Unknown=98, NotChecked=490, Total=2862 [2024-11-09 06:14:08,232 INFO L87 Difference]: Start difference. First operand 398 states and 516 transitions. Second operand has 36 states, 33 states have (on average 5.0) internal successors, (165), 34 states have internal predecessors, (165), 10 states have call successors, (40), 8 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2024-11-09 06:15:31,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:15:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:15:41,467 INFO L93 Difference]: Finished difference Result 1567 states and 1985 transitions. [2024-11-09 06:15:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-09 06:15:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 5.0) internal successors, (165), 34 states have internal predecessors, (165), 10 states have call successors, (40), 8 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) Word has length 126 [2024-11-09 06:15:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:15:41,475 INFO L225 Difference]: With dead ends: 1567 [2024-11-09 06:15:41,475 INFO L226 Difference]: Without dead ends: 1172 [2024-11-09 06:15:41,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 133.5s TimeCoverageRelationStatistics Valid=1816, Invalid=9857, Unknown=119, NotChecked=1090, Total=12882 [2024-11-09 06:15:41,482 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1336 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 3276 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:15:41,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 1652 Invalid, 3548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 3276 Invalid, 0 Unknown, 0 Unchecked, 49.3s Time] [2024-11-09 06:15:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-09 06:15:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 990. [2024-11-09 06:15:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 812 states have (on average 1.2352216748768472) internal successors, (1003), 824 states have internal predecessors, (1003), 122 states have call successors, (122), 55 states have call predecessors, (122), 55 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-09 06:15:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1247 transitions. [2024-11-09 06:15:41,788 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1247 transitions. Word has length 126 [2024-11-09 06:15:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:15:41,789 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1247 transitions. [2024-11-09 06:15:41,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 5.0) internal successors, (165), 34 states have internal predecessors, (165), 10 states have call successors, (40), 8 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2024-11-09 06:15:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1247 transitions. [2024-11-09 06:15:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 06:15:41,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:15:41,794 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:15:41,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 06:15:42,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-09 06:15:42,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-09 06:15:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:15:42,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:15:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:15:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -484517755, now seen corresponding path program 1 times [2024-11-09 06:15:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:15:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268202543] [2024-11-09 06:15:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:15:42,397 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-09 06:15:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:15:42,398 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:15:42,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-09 06:15:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:15:43,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 06:15:43,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:15:48,377 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-09 06:15:50,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 06:15:54,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:15:56,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 129 treesize of output 102 [2024-11-09 06:15:59,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:16:02,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:02,883 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 140 treesize of output 67 [2024-11-09 06:16:03,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:16:03,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:16: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 129 treesize of output 102 [2024-11-09 06:16:04,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:16:05,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:16:05,159 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 175 treesize of output 67 [2024-11-09 06:16:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:16:05,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:06,412 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1117) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:16:06,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1117 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1116) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1117) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:16:06,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1117 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1114) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1116) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1117) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:16:07,559 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:16:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268202543] [2024-11-09 06:16:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268202543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1434764850] [2024-11-09 06:16:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:07,560 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:16:07,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:16:07,563 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:16:07,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-09 06:16:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:09,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 06:16:09,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:15,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:16:19,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 06:16:23,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:26,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:28,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 63 [2024-11-09 06:16:33,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:34,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:34,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:35,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-09 06:16:36,236 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 139 treesize of output 67 [2024-11-09 06:16:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 252 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:16:36,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:37,896 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1155) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:16:38,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1152) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1155) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:16:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1434764850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:39,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150469937] [2024-11-09 06:16:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:39,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:16:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:16:39,360 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:16:39,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b84eee1-b3ab-43a1-8e9b-ffbc424bd016/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-09 06:16:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:39,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 06:16:39,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:45,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 06:16:49,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:16:52,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 129 treesize of output 102 [2024-11-09 06:16:55,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-09 06:17:01,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:01,175 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 163 treesize of output 85 [2024-11-09 06:17:01,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:17:02,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:17:03,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:17:03,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-09 06:17:04,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:04,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 78 [2024-11-09 06:17:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 140 proven. 132 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 06:17:04,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:17:05,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1190) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:17:05,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1189) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1190) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:17:05,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1187) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1189) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1190) |c_~#float_Array_0~0.base|))) (fp.leq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg (let ((.cse2 (select .cse1 (bvadd (_ bv8 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) is different from false [2024-11-09 06:17:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150469937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:17:08,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:17:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 37 [2024-11-09 06:17:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574848050] [2024-11-09 06:17:08,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:17:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:17:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:17:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:17:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1748, Unknown=77, NotChecked=760, Total=2862 [2024-11-09 06:17:08,158 INFO L87 Difference]: Start difference. First operand 990 states and 1247 transitions. Second operand has 38 states, 38 states have (on average 3.973684210526316) internal successors, (151), 37 states have internal predecessors, (151), 10 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36)