./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:57:25,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:57:25,641 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:57:25,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:57:25,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:57:25,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:57:25,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:57:25,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:57:25,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:57:25,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:57:25,698 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:57:25,698 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:57:25,698 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:57:25,698 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:57:25,699 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:57:25,699 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:57:25,701 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:57:25,702 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:57:25,702 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:57:25,702 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:57:25,703 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:57:25,703 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:57:25,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:57:25,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:57:25,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:57:25,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:57:25,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:57:25,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:57:25,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:57:25,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:57:25,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:57:25,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:57:25,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:57:25,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:57:25,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:57:25,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:57:25,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:57:25,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:57:25,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:57:25,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:57:25,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:57:25,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:57:25,712 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:57:25,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:57:25,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:57:25,713 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:57:25,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:57:25,713 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 [2024-11-09 06:57:26,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:57:26,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:57:26,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:57:26,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:57:26,070 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:57:26,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i Unable to find full path for "g++" [2024-11-09 06:57:28,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:57:28,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:57:28,372 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-09 06:57:28,387 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data/0aa56c82f/afef1fa180a74a9ebfbe60ccc2d379ac/FLAG5f3bff804 [2024-11-09 06:57:28,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data/0aa56c82f/afef1fa180a74a9ebfbe60ccc2d379ac [2024-11-09 06:57:28,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:57:28,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:57:28,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:57:28,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:57:28,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:57:28,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0914e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28, skipping insertion in model container [2024-11-09 06:57:28,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:57:28,685 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_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-09 06:57:28,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:57:28,766 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:57:28,778 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_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-09 06:57:28,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:57:28,860 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:57:28,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28 WrapperNode [2024-11-09 06:57:28,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:57:28,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:57:28,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:57:28,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:57:28,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,943 INFO L138 Inliner]: procedures = 30, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-11-09 06:57:28,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:57:28,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:57:28,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:57:28,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:57:28,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:28,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:29,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:57:29,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:57:29,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:57:29,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:57:29,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (1/1) ... [2024-11-09 06:57:29,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:57:29,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:29,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:57:29,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:57:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:57:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 06:57:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 06:57:29,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:57:29,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 06:57:29,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 06:57:29,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:57:29,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:57:29,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:57:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:57:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:57:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:57:29,290 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:57:29,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:57:30,090 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-09 06:57:30,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:57:30,836 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:57:30,836 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:57:30,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:30 BoogieIcfgContainer [2024-11-09 06:57:30,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:57:30,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:57:30,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:57:30,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:57:30,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:57:28" (1/3) ... [2024-11-09 06:57:30,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:57:30, skipping insertion in model container [2024-11-09 06:57:30,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:28" (2/3) ... [2024-11-09 06:57:30,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:57:30, skipping insertion in model container [2024-11-09 06:57:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:30" (3/3) ... [2024-11-09 06:57:30,850 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-11-09 06:57:30,906 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:57:30,906 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:57:31,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:57:31,019 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;@5b4e752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:57:31,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:57:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:57:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 06:57:31,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:31,038 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:31,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:31,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 905874068, now seen corresponding path program 1 times [2024-11-09 06:57:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166605988] [2024-11-09 06:57:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:57:33,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:57:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:57:34,564 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:57:34,567 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:57:34,569 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 06:57:34,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:57:34,580 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 06:57:34,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:57:34,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:57:34 BoogieIcfgContainer [2024-11-09 06:57:34,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:57:34,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:57:34,666 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:57:34,666 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:57:34,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:30" (3/4) ... [2024-11-09 06:57:34,671 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:57:34,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:57:34,674 INFO L158 Benchmark]: Toolchain (without parser) took 6264.84ms. Allocated memory was 125.8MB in the beginning and 316.7MB in the end (delta: 190.8MB). Free memory was 66.2MB in the beginning and 134.4MB in the end (delta: -68.2MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2024-11-09 06:57:34,675 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:57:34,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.45ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 66.1MB in the beginning and 137.6MB in the end (delta: -71.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-09 06:57:34,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.76ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 133.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:57:34,677 INFO L158 Benchmark]: Boogie Preprocessor took 59.14ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 129.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:57:34,678 INFO L158 Benchmark]: RCFGBuilder took 1833.13ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 116.7MB in the end (delta: 12.6MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-09 06:57:34,679 INFO L158 Benchmark]: TraceAbstraction took 3825.41ms. Allocated memory was 176.2MB in the beginning and 316.7MB in the end (delta: 140.5MB). Free memory was 116.7MB in the beginning and 135.5MB in the end (delta: -18.8MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. [2024-11-09 06:57:34,679 INFO L158 Benchmark]: Witness Printer took 6.87ms. Allocated memory is still 316.7MB. Free memory was 135.5MB in the beginning and 134.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:57:34,683 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 125.8MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.45ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 66.1MB in the beginning and 137.6MB in the end (delta: -71.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.76ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 133.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.14ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 129.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1833.13ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 116.7MB in the end (delta: 12.6MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3825.41ms. Allocated memory was 176.2MB in the beginning and 316.7MB in the end (delta: 140.5MB). Free memory was 116.7MB in the beginning and 135.5MB in the end (delta: -18.8MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. * Witness Printer took 6.87ms. Allocated memory is still 316.7MB. Free memory was 135.5MB in the beginning and 134.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -16, 50.75, 7.675, 10, 32.5, 1000000.7, 2.4, 1, 1, 1, 5, 200, 10, 1 }; [L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_11 [L116] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L96] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F [L96] EXPR WrapperStruct00.var_1_9 [L96] EXPR WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F [L96] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L98] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L100] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L101] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) [L113] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L127] RET updateVariables() [L128] CALL step() [L59] EXPR WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_2 [L59] COND TRUE WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2 [L60] COND TRUE \read(last_1_WrapperStruct00_var_1_11) [L61] COND FALSE !(! last_1_WrapperStruct00_var_1_11) [L64] EXPR WrapperStruct00.var_1_9 [L64] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_9 [L68] EXPR WrapperStruct00.var_1_8 [L68] EXPR WrapperStruct00.var_1_8 [L68] COND FALSE !(WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) [L71] EXPR WrapperStruct00.var_1_11 [L71] unsigned char stepLocal_0 = WrapperStruct00.var_1_11; [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_8 [L72] EXPR WrapperStruct00.var_1_8 [L72] COND FALSE !((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) [L81] EXPR WrapperStruct00.var_1_11 [L81] COND FALSE !(! WrapperStruct00.var_1_11) [L84] EXPR WrapperStruct00.var_1_16 [L84] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_16 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11 [L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR WrapperStruct00.var_1_8 [L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1 [L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1 [L119] EXPR (((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1) [L119] EXPR ((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1) [L119] EXPR (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) [L119-L120] return (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 1, TraceHistogramMax: 16, 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=41occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 06:57:34,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:57:37,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:57:37,692 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:57:37,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:57:37,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:57:37,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:57:37,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:57:37,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:57:37,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:57:37,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:57:37,741 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:57:37,742 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:57:37,742 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:57:37,743 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:57:37,743 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:57:37,744 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:57:37,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:57:37,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:57:37,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:57:37,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:57:37,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:57:37,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:57:37,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:57:37,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:57:37,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:57:37,755 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:57:37,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:57:37,755 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:57:37,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:57:37,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:57:37,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:57:37,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:57:37,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:57:37,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:57:37,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:57:37,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:57:37,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:57:37,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:57:37,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:57:37,763 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:57:37,764 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:57:37,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:57:37,767 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:57:37,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445 [2024-11-09 06:57:38,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:57:38,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:57:38,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:57:38,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:57:38,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:57:38,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i Unable to find full path for "g++" [2024-11-09 06:57:40,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:57:40,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:57:40,558 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i [2024-11-09 06:57:40,570 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data/b36a51c26/038f86da8bee430f91b2a588a2190f34/FLAGa23e58e65 [2024-11-09 06:57:40,589 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/data/b36a51c26/038f86da8bee430f91b2a588a2190f34 [2024-11-09 06:57:40,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:57:40,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:57:40,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:57:40,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:57:40,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:57:40,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:57:40" (1/1) ... [2024-11-09 06:57:40,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2f58b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:40, skipping insertion in model container [2024-11-09 06:57:40,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:57:40" (1/1) ... [2024-11-09 06:57:40,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:57:40,875 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_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-09 06:57:40,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:57:40,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:57:40,984 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_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929] [2024-11-09 06:57:41,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:57:41,111 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:57:41,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41 WrapperNode [2024-11-09 06:57:41,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:57:41,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:57:41,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:57:41,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:57:41,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,194 INFO L138 Inliner]: procedures = 34, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-11-09 06:57:41,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:57:41,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:57:41,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:57:41,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:57:41,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:57:41,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:57:41,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:57:41,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:57:41,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (1/1) ... [2024-11-09 06:57:41,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:57:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:41,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:57:41,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:57:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:57:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 06:57:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2024-11-09 06:57:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 06:57:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 06:57:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:57:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-09 06:57:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-09 06:57:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2024-11-09 06:57:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:57:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:57:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2024-11-09 06:57:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:57:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:57:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 06:57:41,551 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:57:41,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:57:52,981 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-11-09 06:57:52,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:57:53,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:57:53,011 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:57:53,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:53 BoogieIcfgContainer [2024-11-09 06:57:53,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:57:53,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:57:53,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:57:53,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:57:53,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:57:40" (1/3) ... [2024-11-09 06:57:53,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507abf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:57:53, skipping insertion in model container [2024-11-09 06:57:53,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:41" (2/3) ... [2024-11-09 06:57:53,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507abf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:57:53, skipping insertion in model container [2024-11-09 06:57:53,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:53" (3/3) ... [2024-11-09 06:57:53,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i [2024-11-09 06:57:53,050 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:57:53,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:57:53,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:57:53,143 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;@1a4b29b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:57:53,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:57:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:57:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 06:57:53,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:53,168 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:53,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:53,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1123503858, now seen corresponding path program 1 times [2024-11-09 06:57:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80413986] [2024-11-09 06:57:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:53,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:53,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:53,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 06:57:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:54,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 06:57:54,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-09 06:57:54,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:54,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80413986] [2024-11-09 06:57:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80413986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:57:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547725756] [2024-11-09 06:57:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:54,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:57:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:54,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:57:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:57:54,959 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:57:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:55,012 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-11-09 06:57:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:57:55,014 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-09 06:57:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:55,022 INFO L225 Difference]: With dead ends: 271 [2024-11-09 06:57:55,022 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 06:57:55,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:57:55,029 INFO L432 NwaCegarLoop]: 201 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, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:55,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:57:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 06:57:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 06:57:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:57:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-09 06:57:55,098 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-11-09 06:57:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-09 06:57:55,099 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:57:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-09 06:57:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 06:57:55,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:55,109 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:55,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 06:57:55,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:55,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:55,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:55,311 INFO L85 PathProgramCache]: Analyzing trace with hash 328080218, now seen corresponding path program 1 times [2024-11-09 06:57:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549795159] [2024-11-09 06:57:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:55,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:55,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 06:57:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:56,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:57:56,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 06:57:56,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:56,614 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:56,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549795159] [2024-11-09 06:57:56,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549795159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:56,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:56,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:56,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538893470] [2024-11-09 06:57:56,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:56,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:56,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:56,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:56,619 INFO L87 Difference]: Start difference. First operand 135 states and 201 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:57:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:56,791 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-11-09 06:57:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:57:56,792 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-09 06:57:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:56,794 INFO L225 Difference]: With dead ends: 269 [2024-11-09 06:57:56,794 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 06:57:56,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:56,797 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:56,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:57:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 06:57:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 06:57:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:57:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-09 06:57:56,812 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-11-09 06:57:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:56,813 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-09 06:57:56,813 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:57:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-09 06:57:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 06:57:56,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:56,816 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:56,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:57:57,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:57,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:57,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1610252504, now seen corresponding path program 1 times [2024-11-09 06:57:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135496950] [2024-11-09 06:57:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:57,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:57,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:57,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:57,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 06:57:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:58,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:57:58,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 06:57:58,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:58,240 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:58,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135496950] [2024-11-09 06:57:58,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135496950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:58,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:58,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623136077] [2024-11-09 06:57:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:58,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:58,244 INFO L87 Difference]: Start difference. First operand 137 states and 203 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:57:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:58,416 INFO L93 Difference]: Finished difference Result 273 states and 406 transitions. [2024-11-09 06:57:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:57:58,417 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-09 06:57:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:58,419 INFO L225 Difference]: With dead ends: 273 [2024-11-09 06:57:58,419 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:57:58,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:58,422 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:58,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:57:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:57:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 06:57:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 121 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:57:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-11-09 06:57:58,435 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 133 [2024-11-09 06:57:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:58,436 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-11-09 06:57:58,436 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:57:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-11-09 06:57:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 06:57:58,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:58,439 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:58,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 06:57:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:58,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:58,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1913981226, now seen corresponding path program 1 times [2024-11-09 06:57:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:58,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022011329] [2024-11-09 06:57:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:58,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:58,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:58,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:58,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 06:57:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:59,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:57:59,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:00,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:00,083 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022011329] [2024-11-09 06:58:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022011329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:00,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:00,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:58:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544405097] [2024-11-09 06:58:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:00,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:58:00,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:00,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:58:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:58:00,087 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:00,241 INFO L93 Difference]: Finished difference Result 277 states and 410 transitions. [2024-11-09 06:58:00,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:58:00,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-09 06:58:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:00,247 INFO L225 Difference]: With dead ends: 277 [2024-11-09 06:58:00,247 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 06:58:00,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:58:00,253 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:00,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:58:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 06:58:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-09 06:58:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-09 06:58:00,281 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 133 [2024-11-09 06:58:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:00,286 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-09 06:58:00,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-09 06:58:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 06:58:00,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:00,289 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:00,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 06:58:00,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:00,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:00,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1212803046, now seen corresponding path program 1 times [2024-11-09 06:58:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:00,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170009058] [2024-11-09 06:58:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:00,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:00,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:00,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:00,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 06:58:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:01,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:58:01,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:02,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:02,024 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170009058] [2024-11-09 06:58:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170009058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:02,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703548569] [2024-11-09 06:58:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:58:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:58:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:02,028 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:02,294 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-11-09 06:58:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:58:02,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-09 06:58:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:02,297 INFO L225 Difference]: With dead ends: 282 [2024-11-09 06:58:02,297 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 06:58:02,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:02,299 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:02,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:58:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 06:58:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 06:58:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-09 06:58:02,312 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 135 [2024-11-09 06:58:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:02,313 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-09 06:58:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-09 06:58:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 06:58:02,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:02,316 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:02,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 06:58:02,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:02,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:02,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1932998259, now seen corresponding path program 1 times [2024-11-09 06:58:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224838055] [2024-11-09 06:58:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:02,527 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:02,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 06:58:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:03,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:58:03,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:03,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:03,974 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:03,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224838055] [2024-11-09 06:58:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224838055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:03,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:03,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:58:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352097690] [2024-11-09 06:58:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:58:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:58:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:58:03,977 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:07,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:08,368 INFO L93 Difference]: Finished difference Result 286 states and 419 transitions. [2024-11-09 06:58:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:58:08,370 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-09 06:58:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:08,372 INFO L225 Difference]: With dead ends: 286 [2024-11-09 06:58:08,372 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 06:58:08,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:08,374 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:08,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 06:58:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 06:58:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-09 06:58:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 127 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-11-09 06:58:08,385 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 136 [2024-11-09 06:58:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-11-09 06:58:08,387 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-11-09 06:58:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 06:58:08,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:08,389 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:08,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 06:58:08,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:08,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1775163023, now seen corresponding path program 1 times [2024-11-09 06:58:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515485788] [2024-11-09 06:58:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:08,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:08,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:08,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:08,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 06:58:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:09,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:58:09,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:09,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:09,958 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:09,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515485788] [2024-11-09 06:58:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515485788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846854496] [2024-11-09 06:58:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:58:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:58:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:09,962 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:10,285 INFO L93 Difference]: Finished difference Result 290 states and 423 transitions. [2024-11-09 06:58:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:58:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-09 06:58:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:10,291 INFO L225 Difference]: With dead ends: 290 [2024-11-09 06:58:10,291 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 06:58:10,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:10,293 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:10,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:58:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 06:58:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-09 06:58:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-09 06:58:10,304 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 136 [2024-11-09 06:58:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:10,305 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-09 06:58:10,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-09 06:58:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 06:58:10,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:10,308 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:10,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:10,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:10,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:10,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -148505425, now seen corresponding path program 1 times [2024-11-09 06:58:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552070746] [2024-11-09 06:58:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:10,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:10,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 06:58:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:11,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:58:11,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:11,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:11,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552070746] [2024-11-09 06:58:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552070746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:58:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196301284] [2024-11-09 06:58:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:11,813 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:12,090 INFO L93 Difference]: Finished difference Result 293 states and 426 transitions. [2024-11-09 06:58:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-09 06:58:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:12,092 INFO L225 Difference]: With dead ends: 293 [2024-11-09 06:58:12,093 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 06:58:12,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:12,094 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:12,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:58:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 06:58:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-09 06:58:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 129 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-11-09 06:58:12,104 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 137 [2024-11-09 06:58:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:12,105 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-11-09 06:58:12,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-11-09 06:58:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 06:58:12,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:12,107 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:12,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 06:58:12,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:12,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:12,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419956, now seen corresponding path program 1 times [2024-11-09 06:58:12,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:12,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165474785] [2024-11-09 06:58:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:12,312 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:12,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 06:58:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:13,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:58:13,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:13,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:13,576 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165474785] [2024-11-09 06:58:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165474785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:13,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:13,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056488956] [2024-11-09 06:58:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:58:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:13,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:58:13,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:13,578 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:13,808 INFO L93 Difference]: Finished difference Result 294 states and 427 transitions. [2024-11-09 06:58:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:58:13,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-09 06:58:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:13,810 INFO L225 Difference]: With dead ends: 294 [2024-11-09 06:58:13,810 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 06:58:13,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:58:13,811 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:13,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:58:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 06:58:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-09 06:58:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2024-11-09 06:58:13,819 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 216 transitions. Word has length 137 [2024-11-09 06:58:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:13,823 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 216 transitions. [2024-11-09 06:58:13,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2024-11-09 06:58:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 06:58:13,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:13,825 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:13,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:14,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:14,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 452254388, now seen corresponding path program 1 times [2024-11-09 06:58:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764192682] [2024-11-09 06:58:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:14,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:14,029 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:14,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 06:58:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:15,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:58:15,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:15,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:15,401 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 173 treesize of output 65 [2024-11-09 06:58:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:58:15,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:15,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:15,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764192682] [2024-11-09 06:58:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764192682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:15,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:15,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049335354] [2024-11-09 06:58:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:15,558 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:19,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:21,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:23,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:25,735 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-09 06:58:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:29,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:31,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:33,913 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-09 06:58:36,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:38,284 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-09 06:58:40,286 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-09 06:58:42,289 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-09 06:58:44,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:46,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:48,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:50,563 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-09 06:58:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:51,092 INFO L93 Difference]: Finished difference Result 298 states and 430 transitions. [2024-11-09 06:58:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:58:51,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 06:58:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:51,094 INFO L225 Difference]: With dead ends: 298 [2024-11-09 06:58:51,094 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 06:58:51,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:58:51,095 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:51,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 594 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 16 Unknown, 0 Unchecked, 35.3s Time] [2024-11-09 06:58:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 06:58:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-09 06:58:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:58:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2024-11-09 06:58:51,103 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 138 [2024-11-09 06:58:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:51,104 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2024-11-09 06:58:51,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:58:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2024-11-09 06:58:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:58:51,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:51,106 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:51,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 06:58:51,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:51,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:51,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1097564902, now seen corresponding path program 1 times [2024-11-09 06:58:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643033221] [2024-11-09 06:58:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:51,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:51,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:51,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:51,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 06:58:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:52,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:58:52,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:52,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:52,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:52,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 51 [2024-11-09 06:58:53,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:53,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 98 [2024-11-09 06:58:57,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:57,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 112 treesize of output 121 [2024-11-09 06:59:02,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:02,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-09 06:59:04,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:04,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-09 06:59:06,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:06,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-09 06:59:07,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:07,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 118 [2024-11-09 06:59:12,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:12,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 105 [2024-11-09 06:59:18,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:18,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 102 [2024-11-09 06:59:23,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:23,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111 [2024-11-09 06:59:25,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:25,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 115 [2024-11-09 06:59:27,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:27,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 60 [2024-11-09 06:59:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 384 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 06:59:27,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 06:59:29,179 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:59:29,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643033221] [2024-11-09 06:59:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643033221] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:29,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:59:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2024-11-09 06:59:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522157889] [2024-11-09 06:59:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:59:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:59:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:59:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=104, Unknown=9, NotChecked=0, Total=156 [2024-11-09 06:59:29,182 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:59:32,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:34,613 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-09 06:59:36,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:38,415 INFO L93 Difference]: Finished difference Result 444 states and 639 transitions. [2024-11-09 06:59:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:59:38,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-09 06:59:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:38,424 INFO L225 Difference]: With dead ends: 444 [2024-11-09 06:59:38,424 INFO L226 Difference]: Without dead ends: 297 [2024-11-09 06:59:38,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=47, Invalid=126, Unknown=9, NotChecked=0, Total=182 [2024-11-09 06:59:38,426 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 139 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:38,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 337 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 259 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2024-11-09 06:59:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-09 06:59:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2024-11-09 06:59:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 257 states have (on average 1.3852140077821011) internal successors, (356), 257 states have internal predecessors, (356), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 06:59:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2024-11-09 06:59:38,448 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 140 [2024-11-09 06:59:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:38,449 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2024-11-09 06:59:38,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 06:59:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2024-11-09 06:59:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 06:59:38,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:38,454 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:38,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 06:59:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:59:38,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:59:38,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1883318015, now seen corresponding path program 1 times [2024-11-09 06:59:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:59:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729930363] [2024-11-09 06:59:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:59:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:59:38,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:59:38,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 06:59:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:40,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 06:59:40,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:40,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:40,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:40,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:40,971 INFO L224 Elim1Store]: Index analysis took 636 ms [2024-11-09 06:59:41,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 58 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 21 [2024-11-09 06:59:41,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 49 [2024-11-09 06:59:45,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:45,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 125 [2024-11-09 06:59:48,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:48,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 132 [2024-11-09 06:59:52,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:52,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 131 [2024-11-09 06:59:54,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:54,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 131 [2024-11-09 06:59:55,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:55,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 122 [2024-11-09 06:59:59,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:59,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 118 [2024-11-09 07:00:00,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:00:00,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 118 [2024-11-09 07:00:02,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:00:02,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 128 [2024-11-09 07:00:04,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:00:04,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 141 [2024-11-09 07:00:07,619 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 232 treesize of output 180 [2024-11-09 07:00:07,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:00:07,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:00:07,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 180 treesize of output 228 [2024-11-09 07:00:08,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 79 [2024-11-09 07:00:34,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse12 (concat (select .cse10 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse10 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (.cse2 (let ((.cse11 (select .cse10 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= (select .cse10 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|)))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= (select .cse10 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= (select .cse10 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|))))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) (select .cse10 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (select .cse10 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) (select .cse10 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse3 .cse4 .cse5 (= .cse6 ((_ sign_extend 24) (_ bv1 8))) .cse7 .cse8 .cse9) (and .cse3 .cse4 .cse5 .cse7 (= .cse6 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-09 07:00:36,492 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse12 (concat (select .cse10 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse10 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) (.cse2 (let ((.cse11 (select .cse10 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= (select .cse10 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|)))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= (select .cse10 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= (select .cse10 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|))))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) (select .cse10 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (select .cse10 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) (select .cse10 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse3 .cse4 .cse5 (= .cse6 ((_ sign_extend 24) (_ bv1 8))) .cse7 .cse8 .cse9) (and .cse3 .cse4 .cse5 .cse7 (= .cse6 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-09 07:00:58,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:00:58,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 432 treesize of output 242 [2024-11-09 07:01:20,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse13 (concat (select .cse11 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse11 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) (.cse2 (let ((.cse12 (select .cse11 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (select .cse11 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse10 (select .cse11 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (select .cse11 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 (select .cse11 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse9 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse6 (select .cse11 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (select .cse11 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|))) .cse4 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= .cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)))) (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse8)) .cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) .cse10))) (and (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse3)) .cse4 (exists ((v_prenex_6 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_6) .cse10)) (exists ((v_prenex_8 (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) v_prenex_8))) (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse9 (exists ((v_prenex_9 (_ BitVec 64))) (and (= .cse6 ((_ extract 63 32) v_prenex_9)) (= ((_ extract 31 0) v_prenex_9) .cse5)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-09 07:01:22,958 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse13 (concat (select .cse11 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse11 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) (.cse2 (let ((.cse12 (select .cse11 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse3 (select .cse11 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2)) (.cse10 (select .cse11 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (select .cse11 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 (select .cse11 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse9 (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))) (.cse6 (select .cse11 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (select .cse11 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_21| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_21|))) .cse4 (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (and (= .cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)) (= .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)))) (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse8)) .cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_22|) .cse10))) (and (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse3)) .cse4 (exists ((v_prenex_6 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_6) .cse10)) (exists ((v_prenex_8 (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) v_prenex_8))) (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse9 (exists ((v_prenex_9 (_ BitVec 64))) (and (= .cse6 ((_ extract 63 32) v_prenex_9)) (= ((_ extract 31 0) v_prenex_9) .cse5)))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-09 07:01:23,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:01:23,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 518 treesize of output 194 [2024-11-09 07:01:39,794 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_183 (_ BitVec 32)) (v_arrayElimCell_177 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_183) ((_ extract 30 23) v_arrayElimCell_183) ((_ extract 22 0) v_arrayElimCell_183))) (.cse1 (let ((.cse3 (concat v_arrayElimCell_182 v_arrayElimCell_177))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (= |c_ULTIMATE.start_property_#t~mem103#1| .cse0) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse0) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse0) (= |c_ULTIMATE.start_property_#t~mem101#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:01:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 113 proven. 275 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 07:01:39,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:01:46,033 WARN L851 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from false [2024-11-09 07:01:48,100 WARN L873 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from true [2024-11-09 07:01:54,304 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false [2024-11-09 07:01:56,363 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from true [2024-11-09 07:02:15,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from false [2024-11-09 07:02:17,581 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from true [2024-11-09 07:02:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 07:02:18,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:02:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729930363] [2024-11-09 07:02:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729930363] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:18,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:02:18,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2024-11-09 07:02:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217768672] [2024-11-09 07:02:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:18,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:02:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:02:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:02:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=267, Unknown=14, NotChecked=234, Total=600 [2024-11-09 07:02:18,426 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:02:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:18,443 INFO L93 Difference]: Finished difference Result 589 states and 849 transitions. [2024-11-09 07:02:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:02:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-11-09 07:02:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:18,446 INFO L225 Difference]: With dead ends: 589 [2024-11-09 07:02:18,446 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 07:02:18,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=85, Invalid=267, Unknown=14, NotChecked=234, Total=600 [2024-11-09 07:02:18,449 INFO L432 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:18,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 617 Unchecked, 0.0s Time] [2024-11-09 07:02:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 07:02:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-09 07:02:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 265 states have (on average 1.381132075471698) internal successors, (366), 265 states have internal predecessors, (366), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 07:02:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 430 transitions. [2024-11-09 07:02:18,470 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 430 transitions. Word has length 142 [2024-11-09 07:02:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:18,471 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 430 transitions. [2024-11-09 07:02:18,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:02:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 430 transitions. [2024-11-09 07:02:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 07:02:18,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:18,474 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:18,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:02:18,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:02:18,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:02:18,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -549553450, now seen corresponding path program 1 times [2024-11-09 07:02:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:02:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115335103] [2024-11-09 07:02:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:18,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:02:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:02:18,681 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:02:18,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:02:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:20,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 07:02:20,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:21,870 INFO L224 Elim1Store]: Index analysis took 1216 ms [2024-11-09 07:02:21,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 10 [2024-11-09 07:02:22,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 46 [2024-11-09 07:02:27,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:27,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 96 [2024-11-09 07:02:31,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:31,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 144 [2024-11-09 07:02:35,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:35,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 153 [2024-11-09 07:02:37,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:37,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 153 [2024-11-09 07:02:39,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:39,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 153 [2024-11-09 07:02:42,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:42,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 144 [2024-11-09 07:02:45,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:45,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 140 [2024-11-09 07:02:47,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:47,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 140 [2024-11-09 07:02:50,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:50,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 140 [2024-11-09 07:02:54,632 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 228 treesize of output 182 [2024-11-09 07:02:54,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:54,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:54,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 214 [2024-11-09 07:02:54,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:54,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 112 [2024-11-09 07:02:57,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:02:57,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 417 treesize of output 245 [2024-11-09 07:03:18,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse13 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse13 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse14 (select .cse13 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse4))) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0))))))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_23| (_ BitVec 8))) (= (select .cse13 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_23|)))) (.cse6 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse4)) (.cse7 (select .cse13 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq (let ((.cse12 (concat (select .cse13 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse13 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))))) (.cse9 (exists ((|v_skolemized_q#valueAsBitvector_91| (_ BitVec 64))) (let ((.cse11 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_91|))) (and (fp.leq (let ((.cse10 (concat .cse1 .cse11))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (= .cse11 .cse2)))))) (or (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) .cse8 .cse9) (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9)))))) is different from false [2024-11-09 07:03:20,898 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse13 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse13 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse14 (select .cse13 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse4))) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0))))))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_23| (_ BitVec 8))) (= (select .cse13 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_23|)))) (.cse6 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse4)) (.cse7 (select .cse13 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (fp.leq (let ((.cse12 (concat (select .cse13 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse13 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))))) (.cse9 (exists ((|v_skolemized_q#valueAsBitvector_91| (_ BitVec 64))) (let ((.cse11 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_91|))) (and (fp.leq (let ((.cse10 (concat .cse1 .cse11))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (= .cse11 .cse2)))))) (or (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) .cse8 .cse9) (and .cse5 .cse6 (= .cse7 ((_ sign_extend 24) (_ bv0 8))) .cse8 .cse9)))))) is different from true [2024-11-09 07:03:36,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:03:36,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 537 treesize of output 213 [2024-11-09 07:04:16,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_263 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (concat v_arrayElimCell_263 v_arrayElimCell_267))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (and (fp.leq .cse13 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (= .cse13 |c_ULTIMATE.start_property_#t~mem116#1|))))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))) (or (and .cse0 (exists ((v_arrayElimCell_269 (_ BitVec 32)) (v_arrayElimCell_268 (_ BitVec 32)) (v_prenex_13 (_ BitVec 64))) (let ((.cse3 (let ((.cse8 (concat v_arrayElimCell_268 ((_ extract 31 0) v_prenex_13)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_269) ((_ extract 30 23) v_arrayElimCell_269) ((_ extract 22 0) v_arrayElimCell_269)))) (and (= .cse1 .cse2) (= .cse3 |c_ULTIMATE.start_property_#t~mem117#1|) (fp.leq .cse3 .cse4) (not (fp.lt (fp.sub roundNearestTiesToEven .cse3 .cse5) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven .cse2))) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse6 .cse7))))))))) (and .cse0 (exists ((v_arrayElimCell_269 (_ BitVec 32)) (v_arrayElimCell_268 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_91| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_269) ((_ extract 30 23) v_arrayElimCell_269) ((_ extract 22 0) v_arrayElimCell_269))) (.cse9 (let ((.cse12 (concat v_arrayElimCell_268 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_91|)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (fp.leq .cse9 .cse4) (= .cse1 .cse10) (not (fp.lt (fp.sub roundNearestTiesToEven .cse9 .cse5) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven .cse10))) (fp.mul roundNearestTiesToEven .cse11 (fp.mul roundNearestTiesToEven .cse11 .cse7))))) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse9))))))) is different from false [2024-11-09 07:04:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 31 proven. 277 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 07:04:19,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:04:30,739 WARN L851 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-09 07:04:32,797 WARN L873 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from true [2024-11-09 07:04:43,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-11-09 07:04:45,243 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true [2024-11-09 07:06:17,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (fp.geq |c_ULTIMATE.start_step_#t~mem4#1| |c_ULTIMATE.start_step_#t~mem5#1|) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-11-09 07:06:19,177 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (fp.geq |c_ULTIMATE.start_step_#t~mem4#1| |c_ULTIMATE.start_step_#t~mem5#1|) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true [2024-11-09 07:06:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 07:06:19,960 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:06:19,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115335103] [2024-11-09 07:06:19,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115335103] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:19,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:06:19,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2024-11-09 07:06:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032236363] [2024-11-09 07:06:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:19,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:06:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:06:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:06:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=373, Unknown=9, NotChecked=220, Total=702 [2024-11-09 07:06:19,963 INFO L87 Difference]: Start difference. First operand 300 states and 430 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:06:23,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:06:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:06:26,150 INFO L93 Difference]: Finished difference Result 689 states and 981 transitions. [2024-11-09 07:06:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:06:26,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 07:06:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:06:26,155 INFO L225 Difference]: With dead ends: 689 [2024-11-09 07:06:26,155 INFO L226 Difference]: Without dead ends: 392 [2024-11-09 07:06:26,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=104, Invalid=413, Unknown=9, NotChecked=230, Total=756 [2024-11-09 07:06:26,157 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 45 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 813 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:06:26,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 458 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 1 Unknown, 813 Unchecked, 5.9s Time] [2024-11-09 07:06:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-09 07:06:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 326. [2024-11-09 07:06:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 291 states have (on average 1.3711340206185567) internal successors, (399), 291 states have internal predecessors, (399), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 07:06:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 463 transitions. [2024-11-09 07:06:26,178 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 463 transitions. Word has length 143 [2024-11-09 07:06:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:26,179 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 463 transitions. [2024-11-09 07:06:26,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:06:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 463 transitions. [2024-11-09 07:06:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 07:06:26,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:06:26,181 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:26,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:26,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:26,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:06:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1901310138, now seen corresponding path program 1 times [2024-11-09 07:06:26,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:06:26,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008817534] [2024-11-09 07:06:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:06:26,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:26,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:06:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:27,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:06:27,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:27,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:06:28,279 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 31 treesize of output 15 [2024-11-09 07:06:28,551 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 31 treesize of output 15 [2024-11-09 07:06:28,838 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 26 treesize of output 25 [2024-11-09 07:06:29,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:29,703 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 36 treesize of output 38 [2024-11-09 07:06:31,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:31,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-09 07:06:32,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:32,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-09 07:06:33,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:33,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 27 [2024-11-09 07:06:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 333 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-09 07:06:34,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 07:06:38,965 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:06:38,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008817534] [2024-11-09 07:06:38,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008817534] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:38,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:06:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-09 07:06:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995217896] [2024-11-09 07:06:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:38,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:06:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:06:38,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:06:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:06:38,968 INFO L87 Difference]: Start difference. First operand 326 states and 463 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:06:46,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:06:48,477 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-09 07:06:50,480 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-09 07:06:52,482 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-09 07:06:54,487 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-09 07:06:56,490 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-09 07:06:58,493 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-09 07:07:00,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:07:02,897 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-09 07:07:04,899 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-09 07:07:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:07:10,576 INFO L93 Difference]: Finished difference Result 937 states and 1331 transitions. [2024-11-09 07:07:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:07:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 07:07:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:07:10,581 INFO L225 Difference]: With dead ends: 937 [2024-11-09 07:07:10,582 INFO L226 Difference]: Without dead ends: 614 [2024-11-09 07:07:10,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:07:10,584 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 210 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 35 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:07:10,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 890 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 647 Invalid, 10 Unknown, 0 Unchecked, 30.2s Time] [2024-11-09 07:07:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-09 07:07:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 566. [2024-11-09 07:07:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 517 states have (on average 1.3868471953578336) internal successors, (717), 519 states have internal predecessors, (717), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 07:07:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 805 transitions. [2024-11-09 07:07:10,621 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 805 transitions. Word has length 143 [2024-11-09 07:07:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:07:10,622 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 805 transitions. [2024-11-09 07:07:10,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:07:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 805 transitions. [2024-11-09 07:07:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 07:07:10,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:07:10,625 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:07:10,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:07:10,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:07:10,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:07:10,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1221251768, now seen corresponding path program 1 times [2024-11-09 07:07:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:07:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951362454] [2024-11-09 07:07:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:07:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:07:10,828 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:07:10,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 07:07:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:12,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:07:12,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:12,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:07:12,648 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 31 treesize of output 15 [2024-11-09 07:07:12,924 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 26 treesize of output 25 [2024-11-09 07:07:13,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:13,718 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 36 treesize of output 38 [2024-11-09 07:07:14,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:14,770 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 51 treesize of output 41 [2024-11-09 07:07:16,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:16,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-09 07:07:17,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:17,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-09 07:07:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 333 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-09 07:07:18,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:07:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 07:07:20,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:07:20,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951362454] [2024-11-09 07:07:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951362454] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:07:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:07:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-11-09 07:07:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130364681] [2024-11-09 07:07:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:07:20,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:07:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:07:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:07:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:07:20,306 INFO L87 Difference]: Start difference. First operand 566 states and 805 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:07:24,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:07:26,486 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-09 07:07:28,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:07:30,835 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-09 07:07:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:07:33,800 INFO L93 Difference]: Finished difference Result 1131 states and 1608 transitions. [2024-11-09 07:07:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:07:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 07:07:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:07:33,805 INFO L225 Difference]: With dead ends: 1131 [2024-11-09 07:07:33,805 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 07:07:33,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:07:33,808 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 132 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:07:33,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 495 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 317 Invalid, 4 Unknown, 0 Unchecked, 13.3s Time] [2024-11-09 07:07:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 07:07:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 562. [2024-11-09 07:07:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 513 states have (on average 1.3859649122807018) internal successors, (711), 515 states have internal predecessors, (711), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 07:07:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 799 transitions. [2024-11-09 07:07:33,853 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 799 transitions. Word has length 143 [2024-11-09 07:07:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:07:33,854 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 799 transitions. [2024-11-09 07:07:33,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:07:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 799 transitions. [2024-11-09 07:07:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 07:07:33,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:07:33,857 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:07:33,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 07:07:34,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:07:34,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:07:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -696769973, now seen corresponding path program 1 times [2024-11-09 07:07:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:07:34,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389737143] [2024-11-09 07:07:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:07:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:07:34,060 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:07:34,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 07:07:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:35,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 07:07:35,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:36,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:07:36,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 21 [2024-11-09 07:07:36,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:36,456 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 77 treesize of output 59 [2024-11-09 07:07:39,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:39,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 82 [2024-11-09 07:07:45,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:45,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 89 [2024-11-09 07:07:51,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:51,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 88 [2024-11-09 07:07:52,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:52,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 88 [2024-11-09 07:07:54,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:54,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 88 [2024-11-09 07:07:56,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:56,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 98 [2024-11-09 07:07:58,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:58,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111 [2024-11-09 07:08:01,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:01,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 124 [2024-11-09 07:08:05,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:05,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-09 07:08:09,015 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 152 treesize of output 118 [2024-11-09 07:08:09,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:09,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:09,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 216 [2024-11-09 07:08:09,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:09,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 101 [2024-11-09 07:08:13,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:13,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 265 treesize of output 183 [2024-11-09 07:08:17,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:17,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 280 treesize of output 112 [2024-11-09 07:08:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 276 proven. 112 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 07:08:18,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:08:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 07:08:21,077 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:08:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389737143] [2024-11-09 07:08:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389737143] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:08:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:08:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-11-09 07:08:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409153639] [2024-11-09 07:08:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:21,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:08:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:08:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:08:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=127, Unknown=5, NotChecked=0, Total=182 [2024-11-09 07:08:21,080 INFO L87 Difference]: Start difference. First operand 562 states and 799 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:08:25,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:27,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:29,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:08:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:32,778 INFO L93 Difference]: Finished difference Result 1123 states and 1598 transitions. [2024-11-09 07:08:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:08:32,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-09 07:08:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:32,791 INFO L225 Difference]: With dead ends: 1123 [2024-11-09 07:08:32,792 INFO L226 Difference]: Without dead ends: 564 [2024-11-09 07:08:32,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=54, Invalid=151, Unknown=5, NotChecked=0, Total=210 [2024-11-09 07:08:32,794 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 125 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:32,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 385 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 261 Invalid, 3 Unknown, 0 Unchecked, 11.5s Time] [2024-11-09 07:08:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-09 07:08:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 559. [2024-11-09 07:08:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 510 states have (on average 1.384313725490196) internal successors, (706), 512 states have internal predecessors, (706), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 07:08:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 794 transitions. [2024-11-09 07:08:32,827 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 794 transitions. Word has length 143 [2024-11-09 07:08:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:32,827 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 794 transitions. [2024-11-09 07:08:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 07:08:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 794 transitions. [2024-11-09 07:08:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 07:08:32,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:32,830 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:32,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-09 07:08:33,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:08:33,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:08:33,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -683566956, now seen corresponding path program 1 times [2024-11-09 07:08:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:08:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289942117] [2024-11-09 07:08:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:33,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:08:33,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:08:33,035 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:08:33,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5bcfcfc-9446-4933-a4de-05a3c1d37dd0/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 07:08:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:34,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 07:08:34,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:08:34,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:34,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:34,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:34,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:34,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:35,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:08:35,357 INFO L224 Elim1Store]: Index analysis took 875 ms [2024-11-09 07:08:35,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 61 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 41 [2024-11-09 07:08:36,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 95 [2024-11-09 07:08:44,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 222 treesize of output 159 [2024-11-09 07:08:54,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:54,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 262 treesize of output 192 [2024-11-09 07:08:59,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:08:59,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 187 treesize of output 147 [2024-11-09 07:09:02,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:02,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 187 treesize of output 147 [2024-11-09 07:09:06,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:06,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 187 treesize of output 147 [2024-11-09 07:09:11,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:11,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 182 treesize of output 148 [2024-11-09 07:09:16,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:16,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 182 treesize of output 148 [2024-11-09 07:09:20,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:20,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 127 [2024-11-09 07:09:24,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:24,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 118 [2024-11-09 07:09:32,674 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 142 treesize of output 110 [2024-11-09 07:09:32,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:09:32,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:32,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 198 [2024-11-09 07:09:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2024-11-09 07:09:38,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:09:38,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 397 treesize of output 327 [2024-11-09 07:10:03,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse7 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 (select .cse7 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (let ((.cse19 (select .cse7 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (let ((.cse0 (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|)) (.cse16 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|))) (and (= .cse14 (select .cse7 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (fp.leq (let ((.cse15 (concat .cse14 .cse16))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (= (select .cse7 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) .cse16))))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64))) (let ((.cse11 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|)) (.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_116|))) (and (= .cse9 .cse10) (= .cse11 .cse12) (fp.leq (let ((.cse13 (concat .cse11 .cse9))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))))))) (.cse2 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse8)) (.cse3 (select .cse7 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_33| (_ BitVec 8))) (= (select .cse7 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_33|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_33| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_33|) (select .cse7 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_31| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_31|) (select .cse7 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv0 8))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv1 8))) .cse4 .cse5 .cse6))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse17 (concat .cse12 .cse10))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse8))) (fp.mul roundNearestTiesToEven .cse18 (fp.mul roundNearestTiesToEven .cse18 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from false [2024-11-09 07:10:05,129 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse7 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 (select .cse7 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse8 (let ((.cse19 (select .cse7 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (let ((.cse0 (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|)) (.cse16 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|))) (and (= .cse14 (select .cse7 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (fp.leq (let ((.cse15 (concat .cse14 .cse16))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (= (select .cse7 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) .cse16))))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64))) (let ((.cse11 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|)) (.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_116|))) (and (= .cse9 .cse10) (= .cse11 .cse12) (fp.leq (let ((.cse13 (concat .cse11 .cse9))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))))))) (.cse2 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse8)) (.cse3 (select .cse7 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_33| (_ BitVec 8))) (= (select .cse7 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_33|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_33| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_33|) (select .cse7 (bvadd (_ bv17 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_31| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_31|) (select .cse7 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|)))))) (or (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv0 8))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= .cse3 ((_ sign_extend 24) (_ bv1 8))) .cse4 .cse5 .cse6))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse17 (concat .cse12 .cse10))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse8))) (fp.mul roundNearestTiesToEven .cse18 (fp.mul roundNearestTiesToEven .cse18 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from true [2024-11-09 07:10:25,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:10:25,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 547 treesize of output 271 [2024-11-09 07:11:14,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64)) (v_arrayElimCell_517 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_517) ((_ extract 30 23) v_arrayElimCell_517) ((_ extract 22 0) v_arrayElimCell_517))) (.cse0 (let ((.cse7 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_116|)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse4))) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 .cse3))))) (= .cse5 .cse4) (fp.leq .cse0 .cse6) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse0)))) (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (let ((.cse8 (let ((.cse10 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (and (= .cse8 |c_ULTIMATE.start_property_#t~mem116#1|) (fp.leq .cse8 .cse9))))) (and (exists ((v_prenex_33 (_ BitVec 64))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) v_prenex_33) ((_ extract 31 0) v_prenex_33)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (= .cse11 |c_ULTIMATE.start_property_#t~mem116#1|) (fp.leq .cse11 .cse9)))) (exists ((v_arrayElimCell_517 (_ BitVec 32)) (v_prenex_31 (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_517) ((_ extract 30 23) v_arrayElimCell_517) ((_ extract 22 0) v_arrayElimCell_517))) (.cse13 (let ((.cse16 (concat ((_ extract 63 32) v_prenex_31) ((_ extract 31 0) v_prenex_31)))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (and (fp.leq .cse13 .cse6) (= .cse5 .cse14) (not (fp.lt (fp.sub roundNearestTiesToEven .cse13 .cse1) (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven .cse14))) (fp.mul roundNearestTiesToEven .cse15 (fp.mul roundNearestTiesToEven .cse15 .cse3))))) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse13))))))) is different from false [2024-11-09 07:11:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 1 proven. 387 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 07:11:16,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:28,511 WARN L851 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false [2024-11-09 07:11:30,579 WARN L873 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from true [2024-11-09 07:11:40,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false [2024-11-09 07:11:43,016 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true