./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/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_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:23:29,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:23:29,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:23:29,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:23:29,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:23:29,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:23:29,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:23:29,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:23:29,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:23:29,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:23:29,400 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:23:29,400 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:23:29,400 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:23:29,401 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:23:29,401 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:23:29,401 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:23:29,401 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:23:29,402 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:23:29,402 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:23:29,402 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:23:29,402 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:23:29,402 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:23:29,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:23:29,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:23:29,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:23:29,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:23:29,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:23:29,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:23:29,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:23:29,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:23:29,405 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-11-14 04:23:29,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:23:29,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:23:29,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:23:29,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:23:29,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:23:29,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i Unable to find full path for "g++" [2024-11-14 04:23:31,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:23:32,037 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:23:32,038 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-14 04:23:32,045 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data/3e84ba119/bfecbf57053f456dae0ccc2247d00174/FLAG40ac239d6 [2024-11-14 04:23:32,347 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data/3e84ba119/bfecbf57053f456dae0ccc2247d00174 [2024-11-14 04:23:32,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:23:32,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:23:32,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:23:32,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:23:32,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:23:32,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e969b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32, skipping insertion in model container [2024-11-14 04:23:32,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:23:32,546 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_08944e4e-84b2-4b9c-80e8-53779e215c2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-14 04:23:32,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:23:32,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:23:32,664 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_08944e4e-84b2-4b9c-80e8-53779e215c2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-14 04:23:32,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:23:32,737 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:23:32,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32 WrapperNode [2024-11-14 04:23:32,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:23:32,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:23:32,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:23:32,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:23:32,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,805 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-14 04:23:32,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:23:32,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:23:32,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:23:32,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:23:32,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:23:32,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:23:32,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:23:32,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:23:32,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (1/1) ... [2024-11-14 04:23:32,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:23:32,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:32,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:23:32,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:23:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:23:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:23:32,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:23:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:23:32,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:23:33,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:23:33,081 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:23:33,667 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-14 04:23:33,668 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:23:34,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:23:34,264 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:23:34,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:34 BoogieIcfgContainer [2024-11-14 04:23:34,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:23:34,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:23:34,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:23:34,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:23:34,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:23:32" (1/3) ... [2024-11-14 04:23:34,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d8e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:23:34, skipping insertion in model container [2024-11-14 04:23:34,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:32" (2/3) ... [2024-11-14 04:23:34,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d8e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:23:34, skipping insertion in model container [2024-11-14 04:23:34,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:34" (3/3) ... [2024-11-14 04:23:34,275 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-11-14 04:23:34,296 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:23:34,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-1.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:23:34,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:23:34,378 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;@563dfa94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:23:34,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:23:34,382 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-14 04:23:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 04:23:34,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:34,391 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-14 04:23:34,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1608381721, now seen corresponding path program 1 times [2024-11-14 04:23:34,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:23:34,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038924558] [2024-11-14 04:23:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:23:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 04:23:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738509951] [2024-11-14 04:23:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:23:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:35,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:23:35,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:23:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:23:36,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:23:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:23:37,055 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:23:37,057 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:23:37,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:23:37,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:23:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 04:23:37,264 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:23:37,325 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:23:37,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:23:37 BoogieIcfgContainer [2024-11-14 04:23:37,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:23:37,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:23:37,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:23:37,329 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:23:37,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:34" (3/4) ... [2024-11-14 04:23:37,332 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:23:37,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:23:37,334 INFO L158 Benchmark]: Toolchain (without parser) took 4983.92ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 91.1MB in the beginning and 106.3MB in the end (delta: -15.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-14 04:23:37,335 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:23:37,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.19ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 76.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:23:37,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.53ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:23:37,336 INFO L158 Benchmark]: Boogie Preprocessor took 59.83ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 69.6MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:23:37,336 INFO L158 Benchmark]: RCFGBuilder took 1398.69ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 80.3MB in the end (delta: -10.6MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-11-14 04:23:37,337 INFO L158 Benchmark]: TraceAbstraction took 3061.15ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 79.4MB in the beginning and 106.3MB in the end (delta: -26.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-14 04:23:37,337 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 176.2MB. Free memory was 106.3MB in the beginning and 106.3MB in the end (delta: 14.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:23:37,343 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.30ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.19ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 76.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.53ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.83ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 69.6MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1398.69ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 80.3MB in the end (delta: -10.6MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3061.15ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 79.4MB in the beginning and 106.3MB in the end (delta: -26.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 176.2MB. Free memory was 106.3MB in the beginning and 106.3MB in the end (delta: 14.4kB). 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 shiftLeft at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 86, 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: 2.9s, 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.6s 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-14 04:23:37,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/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_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:23:39,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:23:40,086 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:23:40,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:23:40,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:23:40,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:23:40,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:23:40,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:23:40,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:23:40,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:23:40,146 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:23:40,146 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:23:40,146 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:23:40,146 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:23:40,146 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:23:40,147 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:23:40,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:23:40,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:23:40,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:23:40,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:23:40,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:23:40,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:23:40,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:23:40,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-11-14 04:23:40,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:23:40,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:23:40,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:23:40,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:23:40,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:23:40,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i Unable to find full path for "g++" [2024-11-14 04:23:42,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:23:42,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:23:42,617 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-14 04:23:42,643 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data/d42a13301/5e0a30d4d3a24ffca8e9c2c5890a95a5/FLAGd70bf443c [2024-11-14 04:23:42,905 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/data/d42a13301/5e0a30d4d3a24ffca8e9c2c5890a95a5 [2024-11-14 04:23:42,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:23:42,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:23:42,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:23:42,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:23:42,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:23:42,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:23:42" (1/1) ... [2024-11-14 04:23:42,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13895087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:42, skipping insertion in model container [2024-11-14 04:23:42,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:23:42" (1/1) ... [2024-11-14 04:23:42,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:23:43,088 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_08944e4e-84b2-4b9c-80e8-53779e215c2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-14 04:23:43,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:23:43,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:23:43,185 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_08944e4e-84b2-4b9c-80e8-53779e215c2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-14 04:23:43,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:23:43,266 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:23:43,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43 WrapperNode [2024-11-14 04:23:43,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:23:43,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:23:43,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:23:43,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:23:43,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,344 INFO L138 Inliner]: procedures = 36, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-14 04:23:43,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:23:43,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:23:43,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:23:43,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:23:43,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:23:43,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:23:43,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:23:43,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:23:43,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (1/1) ... [2024-11-14 04:23:43,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:23:43,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:43,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:23:43,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:23:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 04:23:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 04:23:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-14 04:23:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 04:23:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:23:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:23:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:23:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:23:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 04:23:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 04:23:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 04:23:43,666 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:23:43,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:23:44,535 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-14 04:23:44,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:23:44,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:23:44,549 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:23:44,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:44 BoogieIcfgContainer [2024-11-14 04:23:44,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:23:44,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:23:44,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:23:44,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:23:44,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:23:42" (1/3) ... [2024-11-14 04:23:44,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a761193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:23:44, skipping insertion in model container [2024-11-14 04:23:44,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:43" (2/3) ... [2024-11-14 04:23:44,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a761193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:23:44, skipping insertion in model container [2024-11-14 04:23:44,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:44" (3/3) ... [2024-11-14 04:23:44,566 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-11-14 04:23:44,582 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:23:44,585 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-1.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:23:44,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:23:44,657 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;@7feb499a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:23:44,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:23:44,663 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-14 04:23:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:23:44,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:44,679 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-14 04:23:44,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1214986204, now seen corresponding path program 1 times [2024-11-14 04:23:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:23:44,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543845851] [2024-11-14 04:23:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:44,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:23:44,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:23:44,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 04:23:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:45,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:23:45,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:45,211 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-14 04:23:45,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:23:45,211 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543845851] [2024-11-14 04:23:45,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543845851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:23:45,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:23:45,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:23:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728959816] [2024-11-14 04:23:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:23:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:23:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:23:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:23:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:23:45,239 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-14 04:23:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:23:45,267 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-14 04:23:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:23:45,269 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-14 04:23:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:23:45,276 INFO L225 Difference]: With dead ends: 199 [2024-11-14 04:23:45,276 INFO L226 Difference]: Without dead ends: 99 [2024-11-14 04:23:45,279 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-14 04:23:45,282 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-14 04:23:45,283 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-14 04:23:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-14 04:23:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-14 04:23:45,317 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-14 04:23:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-14 04:23:45,323 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 123 [2024-11-14 04:23:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:23:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-14 04:23:45,324 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-14 04:23:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-14 04:23:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:23:45,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:45,327 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-14 04:23:45,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 04:23:45,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:45,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:45,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1444435436, now seen corresponding path program 1 times [2024-11-14 04:23:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:23:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264837406] [2024-11-14 04:23:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:23:45,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:23:45,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 04:23:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:45,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:23:45,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:46,002 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-14 04:23:46,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:23:46,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:46,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264837406] [2024-11-14 04:23:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264837406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:23:46,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:23:46,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:23:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867797186] [2024-11-14 04:23:46,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:23:46,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:23:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:23:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:23:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:23:46,008 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-14 04:23:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:23:46,130 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2024-11-14 04:23:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:23:46,131 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-14 04:23:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:23:46,136 INFO L225 Difference]: With dead ends: 200 [2024-11-14 04:23:46,137 INFO L226 Difference]: Without dead ends: 104 [2024-11-14 04:23:46,137 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-14 04:23:46,138 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-14 04:23:46,139 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-14 04:23:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-14 04:23:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-14 04:23:46,158 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-14 04:23:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-14 04:23:46,160 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 123 [2024-11-14 04:23:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:23:46,164 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-14 04:23:46,164 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-14 04:23:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-14 04:23:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:23:46,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:46,170 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-14 04:23:46,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 04:23:46,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:46,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:46,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1075524498, now seen corresponding path program 1 times [2024-11-14 04:23:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:23:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837222680] [2024-11-14 04:23:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:46,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:23:46,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:23:46,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 04:23:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:46,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:23:46,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:46,832 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-14 04:23:46,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:23:46,832 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837222680] [2024-11-14 04:23:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837222680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:23:46,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:23:46,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:23:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237023714] [2024-11-14 04:23:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:23:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:23:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:23:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:23:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:23:46,834 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-14 04:23:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:23:46,939 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2024-11-14 04:23:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:23:46,942 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-14 04:23:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:23:46,946 INFO L225 Difference]: With dead ends: 206 [2024-11-14 04:23:46,946 INFO L226 Difference]: Without dead ends: 106 [2024-11-14 04:23:46,948 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-14 04:23:46,949 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-14 04:23:46,949 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-14 04:23:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-14 04:23:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-14 04:23:46,964 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-14 04:23:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-11-14 04:23:46,966 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 123 [2024-11-14 04:23:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:23:46,969 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-11-14 04:23:46,969 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-14 04:23:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-11-14 04:23:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:23:46,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:46,975 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-14 04:23:46,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 04:23:47,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:47,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:47,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1073677456, now seen corresponding path program 1 times [2024-11-14 04:23:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:23:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746738737] [2024-11-14 04:23:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:23:47,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:23:47,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 04:23:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:47,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 04:23:47,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:48,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:48,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:23:49,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:23:49,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:23:49,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:23:50,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:23:50,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 20 treesize of output 15 [2024-11-14 04:23:50,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:51,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 19 treesize of output 14 [2024-11-14 04:23:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:51,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:51,219 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-14 04:23:51,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:51,391 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-14 04:23:51,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746738737] [2024-11-14 04:23:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746738737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:51,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1887464500] [2024-11-14 04:23:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:51,605 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:23:51,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:23:51,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:23:51,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-14 04:23:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:52,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:23:52,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:52,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:23:53,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:53,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:53,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:53,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:53,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:54,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:54,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:54,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:54,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:54,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:54,590 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-14 04:23:54,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:54,611 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-14 04:23:54,649 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-14 04:23:54,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1887464500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:54,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996114385] [2024-11-14 04:23:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:54,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:23:54,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:54,753 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:23:54,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:23:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:54,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:23:54,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:55,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:55,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:23:55,642 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-14 04:23:55,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:23:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996114385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:23:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:23:55,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 8] total 16 [2024-11-14 04:23:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455058198] [2024-11-14 04:23:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:23:55,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:23:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:23:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:23:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=326, Unknown=15, NotChecked=120, Total=552 [2024-11-14 04:23:55,644 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-14 04:23:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:23:56,474 INFO L93 Difference]: Finished difference Result 261 states and 370 transitions. [2024-11-14 04:23:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:23:56,477 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-14 04:23:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:23:56,479 INFO L225 Difference]: With dead ends: 261 [2024-11-14 04:23:56,479 INFO L226 Difference]: Without dead ends: 159 [2024-11-14 04:23:56,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=360, Unknown=15, NotChecked=126, Total=600 [2024-11-14 04:23:56,480 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 193 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:23:56,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 312 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:23:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-14 04:23:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-14 04:23:56,506 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-14 04:23:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 218 transitions. [2024-11-14 04:23:56,508 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 218 transitions. Word has length 123 [2024-11-14 04:23:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:23:56,509 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 218 transitions. [2024-11-14 04:23:56,509 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-14 04:23:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2024-11-14 04:23:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:23:56,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:56,511 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-14 04:23:56,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 04:23:56,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 04:23:56,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-14 04:23:57,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:23:57,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2084794706, now seen corresponding path program 1 times [2024-11-14 04:23:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:23:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547753779] [2024-11-14 04:23:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:23:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:23:57,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:23:57,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 04:23:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:57,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 04:23:57,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:23:58,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:23:58,358 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-14 04:23:58,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:23:58,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:23:58,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:23:58,892 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-14 04:23:58,901 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-14 04:23:58,921 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-14 04:23:58,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:23:59,007 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-14 04:23:59,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:23:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547753779] [2024-11-14 04:23:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547753779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:23:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1716200569] [2024-11-14 04:23:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:23:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:23:59,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:23:59,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-14 04:24:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:00,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:24:00,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:00,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:24:01,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:02,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 105 treesize of output 78 [2024-11-14 04:24:02,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:24:03,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:03,961 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-14 04:24:04,116 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-14 04:24:04,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:04,419 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-14 04:24:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1716200569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869271811] [2024-11-14 04:24:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:04,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:04,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:04,432 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:04,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 04:24:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:04,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:24:04,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:06,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-14 04:24:07,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 129 treesize of output 102 [2024-11-14 04:24:07,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:08,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:24:08,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:08,868 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-14 04:24:08,983 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-14 04:24:08,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869271811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:09,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:24:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2024-11-14 04:24:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131647997] [2024-11-14 04:24:09,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:24:09,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 04:24:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 04:24:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1316, Unknown=29, NotChecked=150, Total=1640 [2024-11-14 04:24:09,532 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-14 04:24:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:20,634 INFO L93 Difference]: Finished difference Result 579 states and 801 transitions. [2024-11-14 04:24:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 04:24:20,637 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-14 04:24:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:20,640 INFO L225 Difference]: With dead ends: 579 [2024-11-14 04:24:20,640 INFO L226 Difference]: Without dead ends: 427 [2024-11-14 04:24:20,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=885, Invalid=5567, Unknown=36, NotChecked=318, Total=6806 [2024-11-14 04:24:20,645 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1082 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 251 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:20,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 944 Invalid, 2470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2218 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-14 04:24:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-14 04:24:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 203. [2024-11-14 04:24:20,672 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-14 04:24:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 276 transitions. [2024-11-14 04:24:20,674 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 276 transitions. Word has length 123 [2024-11-14 04:24:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:20,674 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 276 transitions. [2024-11-14 04:24:20,675 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-14 04:24:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 276 transitions. [2024-11-14 04:24:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:24:20,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:20,677 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-14 04:24:20,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-14 04:24:20,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 04:24:21,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-14 04:24:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:21,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1556108050, now seen corresponding path program 1 times [2024-11-14 04:24:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195059841] [2024-11-14 04:24:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:21,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:21,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:24:21,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 04:24:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:21,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:24:21,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:21,607 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-14 04:24:21,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:21,607 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195059841] [2024-11-14 04:24:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195059841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:24:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154048411] [2024-11-14 04:24:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:24:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:24:21,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:21,616 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-14 04:24:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:21,671 INFO L93 Difference]: Finished difference Result 405 states and 552 transitions. [2024-11-14 04:24:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:21,672 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-14 04:24:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:21,676 INFO L225 Difference]: With dead ends: 405 [2024-11-14 04:24:21,677 INFO L226 Difference]: Without dead ends: 205 [2024-11-14 04:24:21,678 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-14 04:24:21,679 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-14 04:24:21,681 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-14 04:24:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-14 04:24:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-14 04:24:21,708 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-14 04:24:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-14 04:24:21,711 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 123 [2024-11-14 04:24:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:21,711 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-14 04:24:21,711 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-14 04:24:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-14 04:24:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 04:24:21,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:21,715 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-14 04:24:21,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-14 04:24:21,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:21,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1897255630, now seen corresponding path program 1 times [2024-11-14 04:24:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230255944] [2024-11-14 04:24:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:21,918 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:24:21,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 04:24:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:22,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:24:22,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:22,170 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-14 04:24:22,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:22,170 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230255944] [2024-11-14 04:24:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230255944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:24:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074662724] [2024-11-14 04:24:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:22,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:24:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:24:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:22,172 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-14 04:24:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:22,235 INFO L93 Difference]: Finished difference Result 407 states and 551 transitions. [2024-11-14 04:24:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:22,236 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-14 04:24:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:22,238 INFO L225 Difference]: With dead ends: 407 [2024-11-14 04:24:22,238 INFO L226 Difference]: Without dead ends: 205 [2024-11-14 04:24:22,239 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-14 04:24:22,240 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-14 04:24:22,240 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-14 04:24:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-14 04:24:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-14 04:24:22,270 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-14 04:24:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 276 transitions. [2024-11-14 04:24:22,272 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 276 transitions. Word has length 123 [2024-11-14 04:24:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:22,273 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 276 transitions. [2024-11-14 04:24:22,274 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-14 04:24:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 276 transitions. [2024-11-14 04:24:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 04:24:22,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:22,276 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-14 04:24:22,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-14 04:24:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:22,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:22,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 351412732, now seen corresponding path program 1 times [2024-11-14 04:24:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591975568] [2024-11-14 04:24:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:22,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:22,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:24:22,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 04:24:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:22,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:24:22,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:23,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:24:23,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:24,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:25,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:26,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:27,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:27,047 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-14 04:24:27,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:24:27,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:24:27,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:24:27,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:27,437 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-14 04:24:27,553 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-14 04:24:27,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:28,001 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-14 04:24:28,023 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-14 04:24:28,074 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591975568] [2024-11-14 04:24:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591975568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [554526375] [2024-11-14 04:24:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:28,074 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:24:28,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:24:28,076 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:24:28,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 04:24:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:29,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 04:24:29,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:30,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:24:31,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:32,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:24:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:33,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:24:34,609 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-14 04:24:34,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:24:34,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:24:34,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:35,045 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-14 04:24:35,161 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-14 04:24:35,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:35,184 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-14 04:24:35,237 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-14 04:24:35,257 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-14 04:24:35,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [554526375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539415702] [2024-11-14 04:24:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:35,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:35,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:35,317 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:35,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 04:24:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:35,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 04:24:35,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:36,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-14 04:24:37,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:24:38,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 129 treesize of output 102 [2024-11-14 04:24:38,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:40,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:40,556 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-14 04:24:40,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-14 04:24:40,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 152 treesize of output 119 [2024-11-14 04:24:40,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-14 04:24:41,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:41,121 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-14 04:24:41,219 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-14 04:24:41,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:41,248 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-14 04:24:41,292 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-14 04:24:41,319 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-14 04:24:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539415702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:41,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:24:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 34 [2024-11-14 04:24:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662504409] [2024-11-14 04:24:41,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:24:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 04:24:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:24:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 04:24:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1362, Unknown=18, NotChecked=664, Total=2256 [2024-11-14 04:24:41,768 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-14 04:24:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:48,921 INFO L93 Difference]: Finished difference Result 703 states and 957 transitions. [2024-11-14 04:24:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 04:24:48,925 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-14 04:24:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:48,928 INFO L225 Difference]: With dead ends: 703 [2024-11-14 04:24:48,929 INFO L226 Difference]: Without dead ends: 501 [2024-11-14 04:24:48,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 404 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=380, Invalid=1986, Unknown=18, NotChecked=808, Total=3192 [2024-11-14 04:24:48,931 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1238 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 169 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:48,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 997 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1980 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-14 04:24:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-14 04:24:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 225. [2024-11-14 04:24:48,959 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-14 04:24:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 303 transitions. [2024-11-14 04:24:48,961 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 303 transitions. Word has length 124 [2024-11-14 04:24:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:48,961 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 303 transitions. [2024-11-14 04:24:48,962 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-14 04:24:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 303 transitions. [2024-11-14 04:24:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 04:24:48,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:48,963 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-14 04:24:48,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 04:24:49,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 04:24:49,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-14 04:24:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:24:49,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -719814315, now seen corresponding path program 1 times [2024-11-14 04:24:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:24:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133218733] [2024-11-14 04:24:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:49,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:24:49,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:24:49,570 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:24:49,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 04:24:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:49,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:24:49,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:50,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:50,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:24:50,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:24:50,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:50,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:50,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:51,025 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-14 04:24:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2024-11-14 04:24:51,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:51,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2024-11-14 04:24:51,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:24:51,349 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-14 04:24:51,501 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-14 04:24:51,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:51,983 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-14 04:24:52,020 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-14 04:24:52,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:24:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133218733] [2024-11-14 04:24:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133218733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [932269821] [2024-11-14 04:24:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:24:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:24:52,494 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:24:52,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-14 04:24:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:53,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 04:24:53,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:54,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:24:55,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:55,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 64 treesize of output 32 [2024-11-14 04:24:56,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:24:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:24:56,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:24:57,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 60 [2024-11-14 04:24:58,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 97 treesize of output 70 [2024-11-14 04:24:58,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-14 04:24:58,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:24:58,876 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-14 04:25:26,283 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-14 04:25:26,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:25:26,480 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-14 04:25:26,691 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-14 04:25:26,776 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-14 04:25:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [932269821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:25:28,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716823114] [2024-11-14 04:25:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:28,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:25:28,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:25:28,026 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:25:28,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 04:25:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:28,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:25:28,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:35,822 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-14 04:25:37,074 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-14 04:25:38,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:25:39,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:25:41,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:25:44,880 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-14 04:25:45,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 04:25:46,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:25:46,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 103 treesize of output 76 [2024-11-14 04:25:47,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:25:47,852 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-14 04:26:15,519 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-14 04:26:15,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:26:16,367 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-14 04:26:16,465 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-14 04:26:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716823114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:26:18,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:26:18,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 39 [2024-11-14 04:26:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971935864] [2024-11-14 04:26:18,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:26:18,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-14 04:26:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:26:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-14 04:26:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2136, Unknown=44, NotChecked=728, Total=3306 [2024-11-14 04:26:18,020 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-14 04:26:36,167 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-14 04:26:38,819 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-14 04:26:42,960 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-14 04:26:46,655 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-14 04:27:02,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:27:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:11,150 INFO L93 Difference]: Finished difference Result 879 states and 1186 transitions. [2024-11-14 04:27:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 04:27:11,151 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-14 04:27:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:11,155 INFO L225 Difference]: With dead ends: 879 [2024-11-14 04:27:11,156 INFO L226 Difference]: Without dead ends: 657 [2024-11-14 04:27:11,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 396 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1668 ImplicationChecksByTransitivity, 79.2s TimeCoverageRelationStatistics Valid=837, Invalid=4258, Unknown=45, NotChecked=1022, Total=6162 [2024-11-14 04:27:11,159 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 824 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 64 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:11,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1473 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2688 Invalid, 5 Unknown, 0 Unchecked, 40.2s Time] [2024-11-14 04:27:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-14 04:27:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 361. [2024-11-14 04:27:11,208 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-14 04:27:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 480 transitions. [2024-11-14 04:27:11,210 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 480 transitions. Word has length 124 [2024-11-14 04:27:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:11,211 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 480 transitions. [2024-11-14 04:27:11,211 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-14 04:27:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 480 transitions. [2024-11-14 04:27:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 04:27:11,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:11,213 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-14 04:27:11,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-14 04:27:11,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 04:27:11,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-14 04:27:11,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:27:11,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:27:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 497557397, now seen corresponding path program 1 times [2024-11-14 04:27:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:27:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651565106] [2024-11-14 04:27:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:27:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:27:11,820 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:27:11,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-14 04:27:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:12,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:27:12,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:12,205 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-14 04:27:12,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:27:12,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:27:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651565106] [2024-11-14 04:27:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651565106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:27:12,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:27:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:27:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802030238] [2024-11-14 04:27:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:27:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:27:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:27:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:27:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:27:12,208 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-14 04:27:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:12,417 INFO L93 Difference]: Finished difference Result 719 states and 957 transitions. [2024-11-14 04:27:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:27:12,418 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-14 04:27:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:12,420 INFO L225 Difference]: With dead ends: 719 [2024-11-14 04:27:12,421 INFO L226 Difference]: Without dead ends: 361 [2024-11-14 04:27:12,422 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-14 04:27:12,422 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-14 04:27:12,423 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-14 04:27:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-14 04:27:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-11-14 04:27:12,457 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-14 04:27:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 479 transitions. [2024-11-14 04:27:12,460 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 479 transitions. Word has length 124 [2024-11-14 04:27:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:12,460 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 479 transitions. [2024-11-14 04:27:12,461 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-14 04:27:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 479 transitions. [2024-11-14 04:27:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 04:27:12,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:12,463 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-14 04:27:12,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-14 04:27:12,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:27:12,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:27:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -548239082, now seen corresponding path program 1 times [2024-11-14 04:27:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:27:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362131686] [2024-11-14 04:27:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:12,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:27:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:27:12,666 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:27:12,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-14 04:27:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:13,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:27:13,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:15,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:27:17,711 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-14 04:27:18,921 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-14 04:27:20,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:27:21,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:27:22,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 57 treesize of output 42 [2024-11-14 04:27:24,928 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-14 04:27:25,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:27:25,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:27:26,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:27:26,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:27:26,462 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-14 04:27:27,093 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-14 04:27:27,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:27,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |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-14 04:27:28,041 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-14 04:27:28,133 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-14 04:27:28,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:27:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362131686] [2024-11-14 04:27:28,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362131686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1992396079] [2024-11-14 04:27:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:28,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:27:28,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:27:28,383 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:27:28,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 04:27:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:30,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 04:27:30,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:34,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:27:37,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:27:38,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:27:40,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:27:41,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 57 treesize of output 42 [2024-11-14 04:27:43,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:27:45,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-14 04:27:46,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 96 treesize of output 69 [2024-11-14 04:27:46,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-14 04:27:47,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-14 04:27:47,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 80 [2024-11-14 04:27:48,101 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-14 04:27:48,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:48,235 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-14 04:27:48,352 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-14 04:27:48,417 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-14 04:27:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1992396079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056723976] [2024-11-14 04:27:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:48,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:48,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:27:48,618 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:27:48,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 04:27:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:49,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 04:27:49,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:53,507 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-14 04:27:54,753 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-14 04:27:55,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:27:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:27:58,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-14 04:28:00,379 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-14 04:28:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:28:00,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:28:00,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 102 treesize of output 75 [2024-11-14 04:28:01,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:01,215 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-14 04:28:01,328 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-14 04:28:01,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:02,165 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-14 04:28:02,234 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-14 04:28:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056723976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:02,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:28:02,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 24 [2024-11-14 04:28:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382656090] [2024-11-14 04:28:02,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:28:02,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 04:28:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:28:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 04:28:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=707, Unknown=25, NotChecked=488, Total=1332 [2024-11-14 04:28:02,471 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-14 04:28:24,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:28:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:29,959 INFO L93 Difference]: Finished difference Result 948 states and 1261 transitions. [2024-11-14 04:28:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 04:28:29,961 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-14 04:28:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:29,967 INFO L225 Difference]: With dead ends: 948 [2024-11-14 04:28:29,967 INFO L226 Difference]: Without dead ends: 590 [2024-11-14 04:28:29,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=276, Invalid=1532, Unknown=30, NotChecked=712, Total=2550 [2024-11-14 04:28:29,969 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 563 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s 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, 22.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:29,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1213 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2024-11-14 04:28:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-14 04:28:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 384. [2024-11-14 04:28:30,013 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-14 04:28:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 512 transitions. [2024-11-14 04:28:30,016 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 512 transitions. Word has length 125 [2024-11-14 04:28:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:30,017 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 512 transitions. [2024-11-14 04:28:30,017 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-14 04:28:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 512 transitions. [2024-11-14 04:28:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 04:28:30,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:30,019 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-14 04:28:30,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-14 04:28:30,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-14 04:28:30,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 04:28:30,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:28:30,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:28:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1619466129, now seen corresponding path program 1 times [2024-11-14 04:28:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:28:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479467475] [2024-11-14 04:28:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:28:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:28:30,625 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:28:30,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 04:28:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:31,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 04:28:31,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:34,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:28:37,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 78 treesize of output 32 [2024-11-14 04:28:40,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:28:41,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:28:43,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:28:47,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:47,227 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-14 04:28:47,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2024-11-14 04:28:47,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 121 treesize of output 94 [2024-11-14 04:28:48,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:28:48,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:28:48,529 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-14 04:28:48,972 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-14 04:28:48,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:28:50,328 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-14 04:28:50,377 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-14 04:28:50,446 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-14 04:28:50,526 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-14 04:28:50,649 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:28:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479467475] [2024-11-14 04:28:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479467475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1104480116] [2024-11-14 04:28:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:28:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:28:50,651 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:28:50,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-14 04:28:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:52,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 04:28:52,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:56,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:29:01,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-14 04:29:05,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 04:29:07,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:09,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:14,244 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-14 04:29:14,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-14 04:29:14,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:15,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:15,979 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-14 04:29:16,417 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-14 04:29:16,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:16,499 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-14 04:29:16,632 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-14 04:29:16,683 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-14 04:29:16,753 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-14 04:29:16,833 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-14 04:29:16,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1104480116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:16,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932064480] [2024-11-14 04:29:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:29:16,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:29:16,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:29:16,970 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:29:16,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 04:29:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:29:17,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 04:29:17,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:29:26,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-14 04:29:31,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 127 treesize of output 100 [2024-11-14 04:29:33,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-14 04:29:35,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 100 [2024-11-14 04:29:41,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:29:41,073 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-14 04:29:41,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:42,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:42,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:29:44,358 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-14 04:29:44,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:48,406 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-14 04:29:48,491 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-14 04:29:48,613 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-14 04:29:49,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932064480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:49,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:29:49,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 53 [2024-11-14 04:29:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055304652] [2024-11-14 04:29:49,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:29:49,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-14 04:29:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:29:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-14 04:29:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=3365, Unknown=83, NotChecked=1572, Total=5402 [2024-11-14 04:29:49,686 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-14 04:30:22,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:30:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:40,394 INFO L93 Difference]: Finished difference Result 1570 states and 2096 transitions. [2024-11-14 04:30:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 04:30:40,395 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-14 04:30:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:40,403 INFO L225 Difference]: With dead ends: 1570 [2024-11-14 04:30:40,403 INFO L226 Difference]: Without dead ends: 1189 [2024-11-14 04:30:40,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2320 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=800, Invalid=6126, Unknown=94, NotChecked=2100, Total=9120 [2024-11-14 04:30:40,407 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1554 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 254 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:40,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 1723 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 3306 Invalid, 1 Unknown, 0 Unchecked, 38.6s Time] [2024-11-14 04:30:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-11-14 04:30:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 552. [2024-11-14 04:30:40,492 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-14 04:30:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 728 transitions. [2024-11-14 04:30:40,495 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 728 transitions. Word has length 125 [2024-11-14 04:30:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:40,496 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 728 transitions. [2024-11-14 04:30:40,496 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-14 04:30:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 728 transitions. [2024-11-14 04:30:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 04:30:40,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:40,501 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-14 04:30:40,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-14 04:30:40,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 04:30:40,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-14 04:30:41,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:30:41,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:30:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 796370221, now seen corresponding path program 1 times [2024-11-14 04:30:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:30:41,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459148714] [2024-11-14 04:30:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:41,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:30:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:30:41,106 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:30:41,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-14 04:30:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:41,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:30:41,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:41,686 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-14 04:30:41,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:30:41,686 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:30:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459148714] [2024-11-14 04:30:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459148714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:41,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:30:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922862903] [2024-11-14 04:30:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:30:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:30:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:30:41,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:30:41,688 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-14 04:30:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:42,953 INFO L93 Difference]: Finished difference Result 1073 states and 1405 transitions. [2024-11-14 04:30:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:30:42,955 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-14 04:30:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:42,958 INFO L225 Difference]: With dead ends: 1073 [2024-11-14 04:30:42,958 INFO L226 Difference]: Without dead ends: 508 [2024-11-14 04:30:42,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:30:42,960 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:42,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 595 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 04:30:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-14 04:30:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 490. [2024-11-14 04:30:43,023 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-14 04:30:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 640 transitions. [2024-11-14 04:30:43,027 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 640 transitions. Word has length 125 [2024-11-14 04:30:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:43,028 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 640 transitions. [2024-11-14 04:30:43,028 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-14 04:30:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 640 transitions. [2024-11-14 04:30:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 04:30:43,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:43,031 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-14 04:30:43,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-14 04:30:43,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:30:43,231 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:30:43,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1043157219, now seen corresponding path program 1 times [2024-11-14 04:30:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:30:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181384586] [2024-11-14 04:30:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:30:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:30:43,234 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:30:43,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-14 04:30:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:43,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:30:43,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:47,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:30:48,973 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-14 04:30:50,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:30:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:30:53,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:30:55,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:30:55,802 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-14 04:30:55,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:30:56,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:30:56,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2024-11-14 04:30:57,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:30:57,049 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-14 04:30:57,576 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-14 04:30:57,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:30:58,249 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-14 04:30:58,450 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-14 04:30:58,529 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-14 04:30:58,634 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-14 04:30:59,334 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:30:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181384586] [2024-11-14 04:30:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181384586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:30:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1906714701] [2024-11-14 04:30:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:59,335 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:30:59,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:30:59,337 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:30:59,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-14 04:31:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:01,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 04:31:01,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:05,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:31:09,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-14 04:31:15,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 04:31:17,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 04:31:19,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 04:31:25,056 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-14 04:31:25,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 97 treesize of output 70 [2024-11-14 04:31:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2024-11-14 04:31:26,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:31:26,901 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-14 04:31:27,540 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-14 04:31:27,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:31:28,580 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-14 04:31:28,634 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-14 04:31:28,735 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-14 04:31:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1906714701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:31:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709948738] [2024-11-14 04:31:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:29,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:31:29,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:31:29,827 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:31:29,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 04:31:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:30,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 04:31:30,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:37,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:31:37,109 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-14 04:31:37,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:31:37,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 62 treesize of output 47 [2024-11-14 04:31:38,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 47 [2024-11-14 04:31:39,280 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-14 04:31:39,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:31:39,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709948738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:31:39,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:31:39,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 19] total 36 [2024-11-14 04:31:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277477404] [2024-11-14 04:31:39,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:31:39,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:31:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:31:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:31:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1432, Unknown=48, NotChecked=602, Total=2352 [2024-11-14 04:31:39,283 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-14 04:31:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:46,878 INFO L93 Difference]: Finished difference Result 1070 states and 1403 transitions. [2024-11-14 04:31:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:31:46,880 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-14 04:31:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:46,884 INFO L225 Difference]: With dead ends: 1070 [2024-11-14 04:31:46,884 INFO L226 Difference]: Without dead ends: 583 [2024-11-14 04:31:46,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=282, Invalid=1504, Unknown=48, NotChecked=616, Total=2450 [2024-11-14 04:31:46,887 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 182 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:46,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 337 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-14 04:31:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-14 04:31:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 418. [2024-11-14 04:31:46,943 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-14 04:31:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 544 transitions. [2024-11-14 04:31:46,946 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 544 transitions. Word has length 125 [2024-11-14 04:31:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:46,946 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 544 transitions. [2024-11-14 04:31:46,946 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-14 04:31:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 544 transitions. [2024-11-14 04:31:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 04:31:46,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:46,949 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-14 04:31:46,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-14 04:31:47,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-14 04:31:47,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 04:31:47,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:31:47,550 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:31:47,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:47,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1557645270, now seen corresponding path program 1 times [2024-11-14 04:31:47,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:47,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764262030] [2024-11-14 04:31:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:47,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:47,553 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:31:47,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-14 04:31:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:47,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:31:47,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:51,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:31:54,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-14 04:31:58,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 127 treesize of output 100 [2024-11-14 04:32:00,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:02,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 127 treesize of output 100 [2024-11-14 04:32:06,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:06,709 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-14 04:32:06,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 04:32:07,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:07,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:08,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:08,129 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-14 04:32:08,606 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-14 04:32:08,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:09,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |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-14 04:32:09,573 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-14 04:32:09,662 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-14 04:32:10,932 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:32:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764262030] [2024-11-14 04:32:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764262030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1892161668] [2024-11-14 04:32:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:10,933 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:32:10,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:32:10,935 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:32:10,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-14 04:32:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:12,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 04:32:12,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:17,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:32:23,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:28,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 103 treesize of output 76 [2024-11-14 04:32:30,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:38,516 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-14 04:32:38,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-14 04:32:39,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:40,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 69 [2024-11-14 04:32:40,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 58 [2024-11-14 04:32:41,205 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-14 04:32:41,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:42,629 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-14 04:32:42,686 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-14 04:32:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1892161668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633002845] [2024-11-14 04:32:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:32:44,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:32:44,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:32:44,090 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:32:44,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 04:32:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:32:44,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 04:32:44,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:32:52,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:52,216 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-14 04:32:52,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:53,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:53,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:32:54,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:32:54,414 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-14 04:32:55,101 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-14 04:32:55,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:32:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633002845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:32:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:32:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 19] total 43 [2024-11-14 04:32:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018035263] [2024-11-14 04:32:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:32:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:32:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:32:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:32:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2099, Unknown=46, NotChecked=500, Total=2970 [2024-11-14 04:32:55,104 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-14 04:33:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:33:01,451 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2024-11-14 04:33:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:33:01,453 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-14 04:33:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:33:01,455 INFO L225 Difference]: With dead ends: 896 [2024-11-14 04:33:01,456 INFO L226 Difference]: Without dead ends: 481 [2024-11-14 04:33:01,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=338, Invalid=2185, Unknown=47, NotChecked=510, Total=3080 [2024-11-14 04:33:01,458 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 224 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 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.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:33:01,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 349 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-14 04:33:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-14 04:33:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 398. [2024-11-14 04:33:01,508 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-14 04:33:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 516 transitions. [2024-11-14 04:33:01,510 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 516 transitions. Word has length 126 [2024-11-14 04:33:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:33:01,511 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 516 transitions. [2024-11-14 04:33:01,511 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-14 04:33:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 516 transitions. [2024-11-14 04:33:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 04:33:01,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:33:01,513 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-14 04:33:01,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-14 04:33:01,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-14 04:33:01,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-14 04:33:02,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:33:02,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:33:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:33:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1774223095, now seen corresponding path program 1 times [2024-11-14 04:33:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:33:02,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694079509] [2024-11-14 04:33:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:02,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:33:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:33:02,117 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:33:02,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 04:33:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:02,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:33:02,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:33:04,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:33:06,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:07,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:09,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:10,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 20 treesize of output 15 [2024-11-14 04:33:11,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:13,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:15,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:16,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 04:33:16,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:17,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:17,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:17,714 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-14 04:33:17,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:33:17,966 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-14 04:33:18,695 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-14 04:33:19,401 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:33:19,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694079509] [2024-11-14 04:33:19,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694079509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:33:19,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1107062704] [2024-11-14 04:33:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:19,402 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:33:19,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:33:19,404 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:33:19,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-14 04:33:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:20,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 04:33:20,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:33:22,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 04:33:24,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:25,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 19 treesize of output 14 [2024-11-14 04:33:26,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:27,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:29,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:30,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:33,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:33,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-14 04:33:34,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-14 04:33:35,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 29 treesize of output 22 [2024-11-14 04:33:35,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-14 04:33:35,813 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-14 04:33:35,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:33:35,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 (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_1046) |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-14 04:33:36,879 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-14 04:33:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1107062704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:33:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732694358] [2024-11-14 04:33:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:33:38,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:33:38,055 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:33:38,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-14 04:33:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:38,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:33:38,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:33:45,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:33:50,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 04:33:53,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 04:33:54,197 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-14 04:33:54,864 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-14 04:33:56,664 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-14 04:33:58,724 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-14 04:33:58,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:34:15,585 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-14 04:35:01,590 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-14 04:35:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732694358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:03,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 16] total 35 [2024-11-14 04:35:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85525632] [2024-11-14 04:35:03,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:03,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 04:35:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:35:03,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 04:35:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2004, Unknown=78, NotChecked=582, Total=2862 [2024-11-14 04:35:03,250 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-14 04:36:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:29,779 INFO L93 Difference]: Finished difference Result 1567 states and 1985 transitions. [2024-11-14 04:36:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-14 04:36:29,780 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-14 04:36:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:29,786 INFO L225 Difference]: With dead ends: 1567 [2024-11-14 04:36:29,786 INFO L226 Difference]: Without dead ends: 1172 [2024-11-14 04:36:29,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3044 ImplicationChecksByTransitivity, 119.6s TimeCoverageRelationStatistics Valid=1797, Invalid=9691, Unknown=92, NotChecked=1302, Total=12882 [2024-11-14 04:36:29,791 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 2458 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 393 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:29,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2458 Valid, 1535 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 3015 Invalid, 1 Unknown, 0 Unchecked, 43.5s Time] [2024-11-14 04:36:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-14 04:36:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 990. [2024-11-14 04:36:30,012 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-14 04:36:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1247 transitions. [2024-11-14 04:36:30,019 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1247 transitions. Word has length 126 [2024-11-14 04:36:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:30,019 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1247 transitions. [2024-11-14 04:36:30,020 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-14 04:36:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1247 transitions. [2024-11-14 04:36:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 04:36:30,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:30,022 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-14 04:36:30,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 04:36:30,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-14 04:36:30,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-14 04:36:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:36:30,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:30,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -484517755, now seen corresponding path program 1 times [2024-11-14 04:36:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:36:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890546915] [2024-11-14 04:36:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:30,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:36:30,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:36:30,625 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:36:30,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-14 04:36:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:31,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:36:31,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:36:35,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:36:38,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:36:41,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:36:44,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:36:46,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:36:50,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:36:50,575 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-14 04:36:50,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:36:51,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:36:52,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-14 04:36:52,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 129 treesize of output 102 [2024-11-14 04:36:52,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:36:52,920 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-14 04:36:53,467 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-14 04:36:53,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:36:54,844 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-14 04:36:55,032 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-14 04:36:56,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:36:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890546915] [2024-11-14 04:36:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890546915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1276254349] [2024-11-14 04:36:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:36:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:36:56,007 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:36:56,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-14 04:36:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:57,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 04:36:57,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:37:03,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:37:08,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:12,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:37:15,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:37:17,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:22,632 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-14 04:37:22,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 04:37:23,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:24,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:25,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 105 treesize of output 78 [2024-11-14 04:37:25,728 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-14 04:37:26,200 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-14 04:37:26,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:37:26,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 (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_1154) |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-14 04:37:27,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (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_1152) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1154) |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-14 04:37:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1276254349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:37:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716913381] [2024-11-14 04:37:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:28,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:37:28,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:37:28,691 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:37:28,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08944e4e-84b2-4b9c-80e8-53779e215c2e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 04:37:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:37:29,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:37:29,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:37:35,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:39,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:42,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102 [2024-11-14 04:37:45,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:51,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:37:51,985 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-14 04:37:52,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-14 04:37:52,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 119 [2024-11-14 04:37:53,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 152 treesize of output 119 [2024-11-14 04:37:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 04:37:55,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:37:55,192 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-14 04:37:55,637 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-14 04:37:55,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:37:56,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (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_1189) |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-14 04:37:56,539 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_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_1187) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_1189) |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-14 04:38:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716913381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:38:00,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:38:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 37 [2024-11-14 04:38:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625002499] [2024-11-14 04:38:00,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:38:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 04:38:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:38:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 04:38:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1725, Unknown=96, NotChecked=558, Total=2652 [2024-11-14 04:38:00,427 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)