./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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_87414cf5-6788-4a98-b030-5e08fb45e887/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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:27:20,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:27:20,178 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:27:20,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:27:20,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:27:20,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:27:20,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:27:20,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:27:20,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:27:20,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:27:20,229 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:27:20,230 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:27:20,230 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:27:20,234 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:27:20,235 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:27:20,235 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:27:20,235 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:27:20,236 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:27:20,236 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:27:20,237 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:27:20,237 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:27:20,238 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:27:20,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:27:20,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:27:20,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:27:20,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:27:20,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:27:20,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:27:20,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:27:20,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:27:20,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:27:20,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:27:20,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:27:20,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:27:20,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:27:20,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:27:20,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:27:20,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:27:20,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:20,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:27:20,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:27:20,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:27:20,249 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:27:20,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:27:20,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:27:20,250 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:27:20,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:27:20,251 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_87414cf5-6788-4a98-b030-5e08fb45e887/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_87414cf5-6788-4a98-b030-5e08fb45e887/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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2024-11-09 01:27:20,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:27:20,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:27:20,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:27:20,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:27:20,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:27:20,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i Unable to find full path for "g++" [2024-11-09 01:27:22,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:27:23,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:27:23,225 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:27:23,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data/e5f482a32/38b8445f035348989659109a34c97524/FLAGd1719dd3f [2024-11-09 01:27:23,262 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data/e5f482a32/38b8445f035348989659109a34c97524 [2024-11-09 01:27:23,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:27:23,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:27:23,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:23,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:27:23,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:27:23,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36bc2a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23, skipping insertion in model container [2024-11-09 01:27:23,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:27:23,550 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_87414cf5-6788-4a98-b030-5e08fb45e887/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-11-09 01:27:23,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:23,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:27:23,652 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_87414cf5-6788-4a98-b030-5e08fb45e887/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-11-09 01:27:23,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:23,708 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:27:23,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23 WrapperNode [2024-11-09 01:27:23,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:23,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:23,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:27:23,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:27:23,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,768 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 366 [2024-11-09 01:27:23,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:23,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:27:23,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:27:23,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:27:23,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:27:23,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:27:23,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:27:23,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:27:23,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:23,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:27:23,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:27:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:27:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 01:27:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:27:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 01:27:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:27:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 01:27:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:27:23,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:27:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:27:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:27:23,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:27:24,053 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:27:24,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:27:24,753 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-09 01:27:24,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:27:25,408 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:27:25,409 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:27:25,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:25 BoogieIcfgContainer [2024-11-09 01:27:25,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:27:25,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:27:25,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:27:25,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:27:25,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:27:23" (1/3) ... [2024-11-09 01:27:25,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f77cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:25, skipping insertion in model container [2024-11-09 01:27:25,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (2/3) ... [2024-11-09 01:27:25,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f77cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:25, skipping insertion in model container [2024-11-09 01:27:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:25" (3/3) ... [2024-11-09 01:27:25,424 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:27:25,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:27:25,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:27:25,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:27:25,553 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;@25902f46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:27:25,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:27:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:27:25,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:25,569 INFO L215 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:25,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:25,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash -547010556, now seen corresponding path program 1 times [2024-11-09 01:27:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:25,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977781334] [2024-11-09 01:27:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:27:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34227498] [2024-11-09 01:27:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:27,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:27,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:27:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:27:28,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:27:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:27:29,060 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:27:29,063 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:27:29,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:27:29,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:29,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:29,273 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 01:27:29,435 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:27:29,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:27:29 BoogieIcfgContainer [2024-11-09 01:27:29,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:27:29,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:27:29,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:27:29,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:27:29,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:25" (3/4) ... [2024-11-09 01:27:29,451 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:27:29,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:27:29,457 INFO L158 Benchmark]: Toolchain (without parser) took 6188.83ms. Allocated memory was 148.9MB in the beginning and 241.2MB in the end (delta: 92.3MB). Free memory was 115.4MB in the beginning and 193.4MB in the end (delta: -78.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-09 01:27:29,457 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 148.9MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:27:29,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.55ms. Allocated memory is still 148.9MB. Free memory was 115.4MB in the beginning and 99.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:27:29,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.04ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 97.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:27:29,462 INFO L158 Benchmark]: Boogie Preprocessor took 61.04ms. Allocated memory is still 148.9MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:27:29,464 INFO L158 Benchmark]: RCFGBuilder took 1578.88ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 94.6MB in the beginning and 124.6MB in the end (delta: -29.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-09 01:27:29,465 INFO L158 Benchmark]: TraceAbstraction took 4029.96ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 123.5MB in the beginning and 193.4MB in the end (delta: -69.9MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-11-09 01:27:29,467 INFO L158 Benchmark]: Witness Printer took 11.47ms. Allocated memory is still 241.2MB. Free memory is still 193.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:27:29,471 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.27ms. Allocated memory is still 148.9MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.55ms. Allocated memory is still 148.9MB. Free memory was 115.4MB in the beginning and 99.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.04ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 97.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.04ms. Allocated memory is still 148.9MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1578.88ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 94.6MB in the beginning and 124.6MB in the end (delta: -29.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4029.96ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 123.5MB in the beginning and 193.4MB in the end (delta: -69.9MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 11.47ms. Allocated memory is still 241.2MB. Free memory is still 193.4MB. 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 47, overapproximation of shiftLeft at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 4; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_7 = 0; [L27] unsigned char* var_1_7_Pointer = &(var_1_7); [L28] signed short int var_1_8 = 100; [L29] signed short int* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 32; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] double var_1_10 = 9.2; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 0.975; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] signed short int var_1_12 = 1; [L37] signed short int* var_1_12_Pointer = &(var_1_12); [L38] signed long int var_1_14 = -16; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char last_1_var_1_1 = 10; [L41] double last_1_var_1_10 = 9.2; [L42] signed short int last_1_var_1_12 = 1; [L43] signed long int last_1_var_1_14 = -16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L84] EXPR \read(var_1_1) [L84] last_1_var_1_1 = var_1_1 [L85] EXPR \read(var_1_10) [L85] last_1_var_1_10 = var_1_10 [L86] EXPR \read(var_1_12) [L86] last_1_var_1_12 = var_1_12 [L87] EXPR \read(var_1_14) [L87] last_1_var_1_14 = var_1_14 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L74] var_1_3 = __VERIFIER_nondet_uchar() [L75] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] var_1_11 = __VERIFIER_nondet_double() [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F [L81] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET updateVariables() [L99] CALL step() [L47] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; [L48] COND TRUE ((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0 [L49] EXPR \read(*var_1_3_Pointer) [L49] EXPR (((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1) [L49] EXPR \read(*var_1_3_Pointer) [L49] EXPR (((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1) [L49] (*(var_1_12_Pointer)) = (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))) [L53] EXPR \read(*var_1_12_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_12_Pointer) [L54] EXPR 10 << (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_14_Pointer) [L54] COND FALSE !((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) [L57] (*(var_1_9_Pointer)) = 64 [L58] EXPR \read(*var_1_11_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_11_Pointer)) [L59] EXPR \read(*var_1_12_Pointer) [L59] COND FALSE !((*(var_1_12_Pointer)) <= 16) [L62] EXPR \read(*var_1_10_Pointer) [L62] EXPR \read(*var_1_10_Pointer) [L62] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L62] EXPR \read(*var_1_10_Pointer) [L62] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L62] EXPR \read(*var_1_10_Pointer) [L62] COND TRUE (((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] COND FALSE !((*(var_1_7_Pointer))) [L66] EXPR \read(*var_1_3_Pointer) [L66] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR ((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) [L90] EXPR \read(*var_1_7_Pointer) [L90] EXPR (*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR (*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) [L90] EXPR ((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR 10 << (*(var_1_12_Pointer)) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) [L90-L91] return (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 1, TraceHistogramMax: 5, 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=19occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:27:29,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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_87414cf5-6788-4a98-b030-5e08fb45e887/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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:27:32,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:27:32,378 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:27:32,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:27:32,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:27:32,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:27:32,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:27:32,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:27:32,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:27:32,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:27:32,426 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:27:32,427 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:27:32,427 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:27:32,430 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:27:32,431 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:27:32,431 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:27:32,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:27:32,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:27:32,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:27:32,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:27:32,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:27:32,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:27:32,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:27:32,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:27:32,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:27:32,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:27:32,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:27:32,439 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:27:32,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:27:32,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:27:32,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:27:32,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:27:32,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:27:32,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:27:32,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:27:32,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:32,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:27:32,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:27:32,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:27:32,445 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:27:32,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:32,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:27:32,446 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:27:32,446 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_87414cf5-6788-4a98-b030-5e08fb45e887/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_87414cf5-6788-4a98-b030-5e08fb45e887/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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2024-11-09 01:27:32,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:27:32,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:27:32,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:27:32,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:27:32,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:27:32,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i Unable to find full path for "g++" [2024-11-09 01:27:35,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:27:35,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:27:35,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:27:35,421 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data/9808599d8/4ab98c00fb2e4896a9c0797e9b852b0f/FLAG53f8c6c54 [2024-11-09 01:27:35,678 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/data/9808599d8/4ab98c00fb2e4896a9c0797e9b852b0f [2024-11-09 01:27:35,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:27:35,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:27:35,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:35,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:27:35,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:27:35,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:35" (1/1) ... [2024-11-09 01:27:35,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4183ee93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:35, skipping insertion in model container [2024-11-09 01:27:35,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:35" (1/1) ... [2024-11-09 01:27:35,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:27:35,980 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_87414cf5-6788-4a98-b030-5e08fb45e887/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-11-09 01:27:36,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:36,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:27:36,146 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_87414cf5-6788-4a98-b030-5e08fb45e887/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-11-09 01:27:36,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:36,223 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:27:36,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36 WrapperNode [2024-11-09 01:27:36,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:36,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:36,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:27:36,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:27:36,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,292 INFO L138 Inliner]: procedures = 36, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 352 [2024-11-09 01:27:36,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:36,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:27:36,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:27:36,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:27:36,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:27:36,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:27:36,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:27:36,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:27:36,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (1/1) ... [2024-11-09 01:27:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:36,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:36,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:27:36,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:27:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:27:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 01:27:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 01:27:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 01:27:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-09 01:27:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:27:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 01:27:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 01:27:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 01:27:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-09 01:27:36,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:27:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:27:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:27:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:27:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 01:27:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-09 01:27:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 01:27:36,694 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:27:36,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:27:37,489 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-09 01:27:37,489 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:27:37,503 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:27:37,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:27:37,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:37 BoogieIcfgContainer [2024-11-09 01:27:37,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:27:37,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:27:37,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:27:37,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:27:37,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:27:35" (1/3) ... [2024-11-09 01:27:37,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6a8d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:37, skipping insertion in model container [2024-11-09 01:27:37,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:36" (2/3) ... [2024-11-09 01:27:37,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6a8d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:37, skipping insertion in model container [2024-11-09 01:27:37,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:37" (3/3) ... [2024-11-09 01:27:37,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:27:37,532 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:27:37,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:27:37,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:27:37,616 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;@50cfaccc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:27:37,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:27:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:27:37,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:37,634 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:37,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:37,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 800847055, now seen corresponding path program 1 times [2024-11-09 01:27:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214370244] [2024-11-09 01:27:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:37,660 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 01:27:37,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:37,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:37,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:38,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:27:38,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 01:27:38,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:38,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214370244] [2024-11-09 01:27:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214370244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:38,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:27:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695401592] [2024-11-09 01:27:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:38,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:27:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:38,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:27:38,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:27:38,184 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:38,229 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-09 01:27:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:27:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:27:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:38,245 INFO L225 Difference]: With dead ends: 133 [2024-11-09 01:27:38,245 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 01:27:38,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 01:27:38,256 INFO L432 NwaCegarLoop]: 92 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, 92 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 01:27:38,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 01:27:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 01:27:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-09 01:27:38,324 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2024-11-09 01:27:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-09 01:27:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-09 01:27:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:27:38,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:38,331 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:38,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:38,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:38,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:38,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 533340181, now seen corresponding path program 1 times [2024-11-09 01:27:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:38,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346818309] [2024-11-09 01:27:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:38,538 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 01:27:38,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:38,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:38,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:38,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:27:38,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:27:38,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:38,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346818309] [2024-11-09 01:27:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346818309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:27:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864092256] [2024-11-09 01:27:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:27:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:27:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:38,939 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:39,012 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2024-11-09 01:27:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:27:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:27:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:39,015 INFO L225 Difference]: With dead ends: 132 [2024-11-09 01:27:39,015 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 01:27:39,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:39,018 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:39,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 01:27:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-09 01:27:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-09 01:27:39,030 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2024-11-09 01:27:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:39,032 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-09 01:27:39,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-09 01:27:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:27:39,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:39,035 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:39,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:39,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1234404759, now seen corresponding path program 1 times [2024-11-09 01:27:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374442448] [2024-11-09 01:27:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:39,239 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 01:27:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:39,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:39,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:39,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:27:39,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:27:39,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:39,659 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374442448] [2024-11-09 01:27:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374442448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:39,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69726927] [2024-11-09 01:27:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:39,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:39,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:39,666 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:39,759 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-09 01:27:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:27:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:39,762 INFO L225 Difference]: With dead ends: 136 [2024-11-09 01:27:39,763 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 01:27:39,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:39,766 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:39,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 01:27:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-09 01:27:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-09 01:27:39,787 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2024-11-09 01:27:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:39,787 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-09 01:27:39,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-09 01:27:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:27:39,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:39,793 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:39,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:39,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1914463129, now seen corresponding path program 1 times [2024-11-09 01:27:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814342556] [2024-11-09 01:27:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:39,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:27:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:40,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:40,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:27:40,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:27:40,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:40,410 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814342556] [2024-11-09 01:27:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814342556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:27:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031095542] [2024-11-09 01:27:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:27:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:27:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:40,418 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:40,580 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2024-11-09 01:27:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:27:40,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:27:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:40,585 INFO L225 Difference]: With dead ends: 142 [2024-11-09 01:27:40,586 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:27:40,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:40,590 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:40,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:27:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-09 01:27:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-09 01:27:40,608 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2024-11-09 01:27:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-09 01:27:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-09 01:27:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:27:40,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:40,612 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:40,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:40,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:40,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1916310171, now seen corresponding path program 1 times [2024-11-09 01:27:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108945945] [2024-11-09 01:27:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:40,820 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 01:27:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:40,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:40,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 01:27:41,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:41,745 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 01:27:42,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:27:43,070 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 01:27:43,531 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 01:27:43,591 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 01:27:43,662 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 01:27:43,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 01:27:43,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 01:27:43,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-09 01:27:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:27:43,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:27:44,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108945945] [2024-11-09 01:27:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108945945] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:44,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:27:44,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 01:27:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684611318] [2024-11-09 01:27:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:27:44,032 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:44,903 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2024-11-09 01:27:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:27:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:44,906 INFO L225 Difference]: With dead ends: 149 [2024-11-09 01:27:44,907 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 01:27:44,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:27:44,911 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:44,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:27:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 01:27:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-09 01:27:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:27:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-09 01:27:44,922 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2024-11-09 01:27:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:44,923 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-09 01:27:44,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:27:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-09 01:27:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:27:44,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:44,926 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:44,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:45,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:45,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1239458734, now seen corresponding path program 1 times [2024-11-09 01:27:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061296076] [2024-11-09 01:27:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:45,129 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 01:27:45,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:45,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:45,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:27:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:45,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:27:45,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:47,438 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 01:27:48,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 82 [2024-11-09 01:27:48,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 82 [2024-11-09 01:27:48,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 82 [2024-11-09 01:27:48,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 150 [2024-11-09 01:27:48,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 149 [2024-11-09 01:27:49,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 01:27:49,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 01:27:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 140 [2024-11-09 01:27:50,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:50,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 131 [2024-11-09 01:27:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:27:50,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:50,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_11_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse4 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 01:27:50,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_136 (_ BitVec 32)) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_136)))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_26|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:27:51,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_136 (_ BitVec 32)) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_134))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_136))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_26|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:27:51,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_136 (_ BitVec 32)) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_133) c_~var_1_8_Pointer~0.base v_ArrVal_134))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_136))))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_26|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 01:27:51,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_136 (_ BitVec 32)) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_132) c_~var_1_14_Pointer~0.base v_ArrVal_133) c_~var_1_8_Pointer~0.base v_ArrVal_134))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_136))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_26|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:27:52,154 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061296076] [2024-11-09 01:27:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061296076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [295312040] [2024-11-09 01:27:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:52,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:52,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:52,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:52,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-09 01:27:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 01:27:53,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:56,225 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 16 treesize of output 17 [2024-11-09 01:27:58,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 01:27:58,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 01:27:58,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 01:27:59,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 128 [2024-11-09 01:27:59,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 01:27:59,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 132 [2024-11-09 01:28:00,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 139 [2024-11-09 01:28:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:28:00,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:00,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_11_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse4 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 01:28:00,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_9_Pointer~0.base v_ArrVal_165))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset ((_ sign_extend 24) (_ bv64 8)))) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_31|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|))))))) is different from false [2024-11-09 01:28:00,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (let ((.cse8 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_164))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store .cse8 c_~var_1_9_Pointer~0.base v_ArrVal_165))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select (store .cse8 c_~var_1_9_Pointer~0.base (store (select .cse8 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset ((_ sign_extend 24) (_ bv64 8)))) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_31|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse9 (let ((.cse10 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse10 .cse6) (select .cse10 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)))))))) is different from false [2024-11-09 01:28:00,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_163) c_~var_1_8_Pointer~0.base v_ArrVal_164))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store .cse10 c_~var_1_9_Pointer~0.base v_ArrVal_165))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset ((_ sign_extend 24) (_ bv64 8)))) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_31|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))))) is different from false [2024-11-09 01:28:01,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (let ((.cse8 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_162) c_~var_1_14_Pointer~0.base v_ArrVal_163) c_~var_1_8_Pointer~0.base v_ArrVal_164))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store .cse8 c_~var_1_9_Pointer~0.base v_ArrVal_165))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select (store .cse8 c_~var_1_9_Pointer~0.base (store (select .cse8 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset ((_ sign_extend 24) (_ bv64 8)))) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_31|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse9 (let ((.cse10 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse10 .cse6) (select .cse10 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)))))))) is different from false [2024-11-09 01:28:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [295312040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453176318] [2024-11-09 01:28:01,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:01,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:01,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:01,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:01,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:28:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 01:28:01,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:03,597 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 19 treesize of output 8 [2024-11-09 01:28:05,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2024-11-09 01:28:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2024-11-09 01:28:05,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2024-11-09 01:28:06,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 138 [2024-11-09 01:28:06,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 137 [2024-11-09 01:28:06,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 01:28:06,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 01:28:06,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 128 [2024-11-09 01:28:07,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:07,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 135 [2024-11-09 01:28:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:28:07,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:07,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_196))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_11_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse4 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 01:28:07,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (v_ArrVal_193 (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_193)))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_36|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|))) c_~var_1_1_Pointer~0.base v_ArrVal_196))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))))))) is different from false [2024-11-09 01:28:07,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (v_ArrVal_193 (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_192))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_193))))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_36|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|))) c_~var_1_1_Pointer~0.base v_ArrVal_196))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:28:07,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (v_ArrVal_193 (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_191) c_~var_1_8_Pointer~0.base v_ArrVal_192))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_193))))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_36|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|))) c_~var_1_1_Pointer~0.base v_ArrVal_196))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))))))) is different from false [2024-11-09 01:28:07,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (v_ArrVal_193 (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_190) c_~var_1_14_Pointer~0.base v_ArrVal_191) c_~var_1_8_Pointer~0.base v_ArrVal_192))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_193))))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_36|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|))) c_~var_1_1_Pointer~0.base v_ArrVal_196))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))))))) is different from false [2024-11-09 01:28:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453176318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:08,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2024-11-09 01:28:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098098060] [2024-11-09 01:28:08,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:08,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 01:28:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 01:28:08,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1054, Unknown=15, NotChecked=1200, Total=2450 [2024-11-09 01:28:08,294 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 33 states have internal predecessors, (113), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 01:28:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:15,255 INFO L93 Difference]: Finished difference Result 211 states and 283 transitions. [2024-11-09 01:28:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:28:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 33 states have internal predecessors, (113), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 62 [2024-11-09 01:28:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:15,258 INFO L225 Difference]: With dead ends: 211 [2024-11-09 01:28:15,258 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 01:28:15,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=315, Invalid=1452, Unknown=15, NotChecked=1410, Total=3192 [2024-11-09 01:28:15,261 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 543 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:15,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 534 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-09 01:28:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 01:28:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2024-11-09 01:28:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:28:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-11-09 01:28:15,277 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 62 [2024-11-09 01:28:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:15,277 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-11-09 01:28:15,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 33 states have internal predecessors, (113), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 01:28:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-11-09 01:28:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:28:15,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:15,283 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:15,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-09 01:28:15,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:15,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 01:28:15,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:15,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:15,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash -559400364, now seen corresponding path program 1 times [2024-11-09 01:28:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566787082] [2024-11-09 01:28:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:15,887 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 01:28:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:15,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:15,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:16,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:28:16,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:16,507 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 01:28:16,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:28:16,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:28:16,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-09 01:28:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:28:16,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:16,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566787082] [2024-11-09 01:28:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566787082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:16,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969153129] [2024-11-09 01:28:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:16,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:28:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:16,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:28:16,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:16,610 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:28:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:17,188 INFO L93 Difference]: Finished difference Result 231 states and 315 transitions. [2024-11-09 01:28:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:28:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:17,190 INFO L225 Difference]: With dead ends: 231 [2024-11-09 01:28:17,190 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 01:28:17,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:28:17,191 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 154 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:17,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 195 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:28:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 01:28:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-09 01:28:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 107 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:28:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2024-11-09 01:28:17,212 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 156 transitions. Word has length 62 [2024-11-09 01:28:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:17,213 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 156 transitions. [2024-11-09 01:28:17,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:28:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2024-11-09 01:28:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:28:17,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:17,215 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:17,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:17,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:17,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:17,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 141664214, now seen corresponding path program 1 times [2024-11-09 01:28:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286686242] [2024-11-09 01:28:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:17,417 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 01:28:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:17,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:17,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:17,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:28:17,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:17,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:28:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:28:18,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 01:28:18,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-09 01:28:19,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2024-11-09 01:28:19,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2024-11-09 01:28:19,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2024-11-09 01:28:19,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2024-11-09 01:28:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:28:19,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:19,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:19,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286686242] [2024-11-09 01:28:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286686242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:19,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:19,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:28:19,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627977938] [2024-11-09 01:28:19,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:19,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:28:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:19,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:28:19,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:28:19,409 INFO L87 Difference]: Start difference. First operand 116 states and 156 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:28:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:22,262 INFO L93 Difference]: Finished difference Result 513 states and 693 transitions. [2024-11-09 01:28:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 01:28:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:28:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:22,265 INFO L225 Difference]: With dead ends: 513 [2024-11-09 01:28:22,265 INFO L226 Difference]: Without dead ends: 400 [2024-11-09 01:28:22,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:28:22,266 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 265 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:22,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 508 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 01:28:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-09 01:28:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 197. [2024-11-09 01:28:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 180 states have internal predecessors, (245), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:28:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 269 transitions. [2024-11-09 01:28:22,294 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 269 transitions. Word has length 62 [2024-11-09 01:28:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:22,295 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 269 transitions. [2024-11-09 01:28:22,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:28:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 269 transitions. [2024-11-09 01:28:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:28:22,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:22,297 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:22,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:22,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:22,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash 564366040, now seen corresponding path program 1 times [2024-11-09 01:28:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899085491] [2024-11-09 01:28:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:22,498 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 01:28:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:22,499 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:22,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:28:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:22,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 01:28:22,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:23,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-09 01:28:23,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-09 01:28:24,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-09 01:28:24,707 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2024-11-09 01:28:24,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 01:28:24,784 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:28:24,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2024-11-09 01:28:25,188 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 69 treesize of output 57 [2024-11-09 01:28:25,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2024-11-09 01:28:25,713 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:28:25,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 39 [2024-11-09 01:28:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:28:25,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:26,172 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_276))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))))) is different from false [2024-11-09 01:28:34,636 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899085491] [2024-11-09 01:28:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899085491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [380205475] [2024-11-09 01:28:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:28:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:28:34,638 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:28:34,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-09 01:28:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:28:35,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:37,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-09 01:28:39,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-09 01:28:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-09 01:28:44,377 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2024-11-09 01:28:44,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 01:28:45,098 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:28:45,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2024-11-09 01:28:46,751 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 80 treesize of output 64 [2024-11-09 01:28:47,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2024-11-09 01:28:49,039 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:28:49,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 42 [2024-11-09 01:28:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:28:49,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:49,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_303))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))))) is different from false [2024-11-09 01:28:49,674 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_9_Pointer~0.base v_ArrVal_302) c_~var_1_10_Pointer~0.base v_ArrVal_301) c_~var_1_1_Pointer~0.base v_ArrVal_303))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))) (bvmul (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset)))))))) is different from false [2024-11-09 01:29:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [380205475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950542178] [2024-11-09 01:29:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:11,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:11,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:29:11,491 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:29:11,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 01:29:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:11,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:29:11,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:12,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:29:16,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:29:17,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 01:29:18,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2024-11-09 01:29:18,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2024-11-09 01:29:18,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2024-11-09 01:29:20,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2024-11-09 01:29:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:29:20,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950542178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:20,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12] total 30 [2024-11-09 01:29:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538881068] [2024-11-09 01:29:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:20,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:29:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:29:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:29:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1234, Unknown=54, NotChecked=234, Total=1806 [2024-11-09 01:29:20,674 INFO L87 Difference]: Start difference. First operand 197 states and 269 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:29:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:30,382 INFO L93 Difference]: Finished difference Result 455 states and 613 transitions. [2024-11-09 01:29:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:29:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:29:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:30,385 INFO L225 Difference]: With dead ends: 455 [2024-11-09 01:29:30,385 INFO L226 Difference]: Without dead ends: 336 [2024-11-09 01:29:30,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=389, Invalid=1631, Unknown=62, NotChecked=270, Total=2352 [2024-11-09 01:29:30,387 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 108 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:30,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 415 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-09 01:29:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-09 01:29:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 219. [2024-11-09 01:29:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 202 states have (on average 1.3613861386138615) internal successors, (275), 202 states have internal predecessors, (275), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:29:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 299 transitions. [2024-11-09 01:29:30,418 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 299 transitions. Word has length 62 [2024-11-09 01:29:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:30,419 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 299 transitions. [2024-11-09 01:29:30,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:29:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 299 transitions. [2024-11-09 01:29:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:29:30,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:30,421 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:30,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:30,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:30,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 01:29:31,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:31,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:31,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1311845292, now seen corresponding path program 1 times [2024-11-09 01:29:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:29:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706112190] [2024-11-09 01:29:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:31,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 01:29:31,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:29:31,028 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:31,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:31,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:29:31,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:29:31,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:31,398 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:29:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706112190] [2024-11-09 01:29:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706112190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:29:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780835411] [2024-11-09 01:29:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:31,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:29:31,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:29:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:29:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:29:31,405 INFO L87 Difference]: Start difference. First operand 219 states and 299 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:29:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:31,556 INFO L93 Difference]: Finished difference Result 378 states and 514 transitions. [2024-11-09 01:29:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:29:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-09 01:29:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:31,558 INFO L225 Difference]: With dead ends: 378 [2024-11-09 01:29:31,558 INFO L226 Difference]: Without dead ends: 219 [2024-11-09 01:29:31,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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 01:29:31,559 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:31,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:29:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-09 01:29:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-09 01:29:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 202 states have (on average 1.3514851485148516) internal successors, (273), 202 states have internal predecessors, (273), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:29:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 297 transitions. [2024-11-09 01:29:31,581 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 297 transitions. Word has length 62 [2024-11-09 01:29:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:31,582 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 297 transitions. [2024-11-09 01:29:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:29:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 297 transitions. [2024-11-09 01:29:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:29:31,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:31,583 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:31,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:31,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:31,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:31,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 264946402, now seen corresponding path program 1 times [2024-11-09 01:29:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:29:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097892032] [2024-11-09 01:29:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:31,785 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 01:29:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:29:31,789 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:31,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:32,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 01:29:32,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:32,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:29:36,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:29:36,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 01:29:36,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-11-09 01:29:37,141 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 52 treesize of output 48 [2024-11-09 01:29:37,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2024-11-09 01:29:39,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2024-11-09 01:29:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:29:39,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:39,907 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:29:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097892032] [2024-11-09 01:29:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097892032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:39,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:39,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:29:39,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139721900] [2024-11-09 01:29:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:39,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:29:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:29:39,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:29:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:29:39,909 INFO L87 Difference]: Start difference. First operand 219 states and 297 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:29:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:48,975 INFO L93 Difference]: Finished difference Result 380 states and 497 transitions. [2024-11-09 01:29:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 01:29:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:29:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:48,978 INFO L225 Difference]: With dead ends: 380 [2024-11-09 01:29:48,978 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 01:29:48,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2024-11-09 01:29:48,979 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 362 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:48,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 521 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-09 01:29:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 01:29:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 242. [2024-11-09 01:29:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 225 states have (on average 1.3333333333333333) internal successors, (300), 225 states have internal predecessors, (300), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:29:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 324 transitions. [2024-11-09 01:29:49,003 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 324 transitions. Word has length 64 [2024-11-09 01:29:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:49,003 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 324 transitions. [2024-11-09 01:29:49,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:29:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 324 transitions. [2024-11-09 01:29:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:29:49,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:49,007 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:49,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:49,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:49,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:49,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 266793444, now seen corresponding path program 1 times [2024-11-09 01:29:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:29:49,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881346501] [2024-11-09 01:29:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:49,209 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 01:29:49,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:29:49,210 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:49,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:29:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:49,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:29:49,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:50,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:29:53,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 01:29:54,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 01:29:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-09 01:29:54,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2024-11-09 01:29:54,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2024-11-09 01:29:55,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2024-11-09 01:29:57,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2024-11-09 01:29:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:29:57,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:57,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:29:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881346501] [2024-11-09 01:29:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881346501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:29:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761375084] [2024-11-09 01:29:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:29:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:29:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:29:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:29:57,946 INFO L87 Difference]: Start difference. First operand 242 states and 324 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:06,212 INFO L93 Difference]: Finished difference Result 501 states and 658 transitions. [2024-11-09 01:30:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:30:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:30:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:06,215 INFO L225 Difference]: With dead ends: 501 [2024-11-09 01:30:06,215 INFO L226 Difference]: Without dead ends: 382 [2024-11-09 01:30:06,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2024-11-09 01:30:06,217 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 234 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:06,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 464 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-09 01:30:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-09 01:30:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 245. [2024-11-09 01:30:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 228 states have (on average 1.3289473684210527) internal successors, (303), 228 states have internal predecessors, (303), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:30:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 327 transitions. [2024-11-09 01:30:06,239 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 327 transitions. Word has length 64 [2024-11-09 01:30:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:06,240 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 327 transitions. [2024-11-09 01:30:06,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 327 transitions. [2024-11-09 01:30:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:30:06,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:06,241 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:30:06,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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)] Ended with exit code 0 [2024-11-09 01:30:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:06,448 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash -327265501, now seen corresponding path program 1 times [2024-11-09 01:30:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:30:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985596678] [2024-11-09 01:30:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:06,450 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 01:30:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:30:06,453 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:06,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:06,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:30:06,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:06,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:30:06,729 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 91 treesize of output 31 [2024-11-09 01:30:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:30:06,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:30:06,807 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:30:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985596678] [2024-11-09 01:30:06,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985596678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:06,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:30:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414544206] [2024-11-09 01:30:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:06,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:30:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:30:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:30:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:30:06,809 INFO L87 Difference]: Start difference. First operand 245 states and 327 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:06,876 INFO L93 Difference]: Finished difference Result 406 states and 539 transitions. [2024-11-09 01:30:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:30:06,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:30:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:06,879 INFO L225 Difference]: With dead ends: 406 [2024-11-09 01:30:06,879 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 01:30:06,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:30:06,880 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:06,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:30:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 01:30:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-09 01:30:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 228 states have internal predecessors, (299), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:30:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2024-11-09 01:30:06,901 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 64 [2024-11-09 01:30:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:06,901 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2024-11-09 01:30:06,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2024-11-09 01:30:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:30:06,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:06,903 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:30:06,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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)] Ended with exit code 0 [2024-11-09 01:30:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:07,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1973557089, now seen corresponding path program 1 times [2024-11-09 01:30:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:30:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240586460] [2024-11-09 01:30:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:07,105 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 01:30:07,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:30:07,107 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:07,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 01:30:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:07,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:30:07,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:08,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 01:30:08,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 01:30:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:30:08,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:30:08,870 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:30:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240586460] [2024-11-09 01:30:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240586460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:08,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:30:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492703183] [2024-11-09 01:30:08,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:08,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:30:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:30:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:30:08,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:30:08,872 INFO L87 Difference]: Start difference. First operand 245 states and 323 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:11,869 INFO L93 Difference]: Finished difference Result 504 states and 649 transitions. [2024-11-09 01:30:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:30:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:30:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:11,872 INFO L225 Difference]: With dead ends: 504 [2024-11-09 01:30:11,873 INFO L226 Difference]: Without dead ends: 341 [2024-11-09 01:30:11,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:30:11,874 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 125 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:11,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 202 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 01:30:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-09 01:30:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 253. [2024-11-09 01:30:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 236 states have internal predecessors, (307), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:30:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 331 transitions. [2024-11-09 01:30:11,897 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 331 transitions. Word has length 64 [2024-11-09 01:30:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:11,897 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 331 transitions. [2024-11-09 01:30:11,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 331 transitions. [2024-11-09 01:30:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:30:11,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:11,899 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:30:11,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-09 01:30:12,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:12,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:12,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -990101679, now seen corresponding path program 1 times [2024-11-09 01:30:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:30:12,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749681300] [2024-11-09 01:30:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:12,105 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 01:30:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:30:12,106 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:12,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 01:30:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:12,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:30:12,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:12,515 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 01:30:12,515 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 33 treesize of output 26 [2024-11-09 01:30:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:30:13,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:30:13,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:30:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749681300] [2024-11-09 01:30:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749681300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:13,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:30:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170297472] [2024-11-09 01:30:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:13,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:30:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:30:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:30:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:30:13,759 INFO L87 Difference]: Start difference. First operand 253 states and 331 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:14,682 INFO L93 Difference]: Finished difference Result 394 states and 509 transitions. [2024-11-09 01:30:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:30:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:30:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:14,685 INFO L225 Difference]: With dead ends: 394 [2024-11-09 01:30:14,685 INFO L226 Difference]: Without dead ends: 263 [2024-11-09 01:30:14,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:30:14,689 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:14,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 280 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:30:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-09 01:30:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 248. [2024-11-09 01:30:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 231 states have (on average 1.2857142857142858) internal successors, (297), 231 states have internal predecessors, (297), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:30:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 321 transitions. [2024-11-09 01:30:14,729 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 321 transitions. Word has length 64 [2024-11-09 01:30:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:14,729 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 321 transitions. [2024-11-09 01:30:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:30:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 321 transitions. [2024-11-09 01:30:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:30:14,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:14,732 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:30:14,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 01:30:14,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:14,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:14,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 196043960, now seen corresponding path program 1 times [2024-11-09 01:30:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:30:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317836466] [2024-11-09 01:30:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:14,936 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 01:30:14,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:30:14,940 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:30:14,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 (21)] Waiting until timeout for monitored process [2024-11-09 01:30:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:15,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 01:30:15,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:20,105 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 01:30:23,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 80 [2024-11-09 01:30:24,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 80 [2024-11-09 01:30:24,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 80 [2024-11-09 01:30:25,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 134 [2024-11-09 01:30:25,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 01:30:25,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 138 [2024-11-09 01:30:27,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:30:27,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 349 treesize of output 129 [2024-11-09 01:30:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:30:27,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:29,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_9_Pointer~0.base v_ArrVal_494))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_491)) c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:30:29,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_490))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store .cse8 c_~var_1_9_Pointer~0.base v_ArrVal_494))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select (store .cse8 c_~var_1_9_Pointer~0.base (store (select .cse8 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_491)) c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse9 (let ((.cse10 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse10 .cse6) (select .cse10 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|)))))))) is different from false [2024-11-09 01:30:30,232 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (_ BitVec 32)) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_489) c_~var_1_8_Pointer~0.base v_ArrVal_490))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store .cse10 c_~var_1_9_Pointer~0.base v_ArrVal_494))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_491)) c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))))) is different from false [2024-11-09 01:30:30,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (_ BitVec 32)) (v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_488) c_~var_1_14_Pointer~0.base v_ArrVal_489) c_~var_1_8_Pointer~0.base v_ArrVal_490))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store .cse10 c_~var_1_9_Pointer~0.base v_ArrVal_494))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_491)) c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))))) is different from false [2024-11-09 01:30:32,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:30:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317836466] [2024-11-09 01:30:32,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317836466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:30:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1830509886] [2024-11-09 01:30:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:30:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:30:32,159 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:30:32,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 01:30:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:33,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 01:30:33,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:39,251 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 16 treesize of output 17 [2024-11-09 01:30:50,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 01:30:51,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 01:30:52,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 01:30:53,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 126 [2024-11-09 01:30:53,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 01:30:54,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 130 [2024-11-09 01:30:56,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 137 [2024-11-09 01:30:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:30:56,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:56,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_525))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_11_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse4 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 01:30:56,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_521 (_ BitVec 32)) (v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_9_Pointer~0.base v_ArrVal_524))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_521)) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) c_~var_1_1_Pointer~0.base v_ArrVal_525))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:30:57,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_521 (_ BitVec 32)) (v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_520))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store .cse8 c_~var_1_9_Pointer~0.base v_ArrVal_524))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select (store .cse8 c_~var_1_9_Pointer~0.base (store (select .cse8 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_521)) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) c_~var_1_1_Pointer~0.base v_ArrVal_525))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse9 (let ((.cse10 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse10 .cse6) (select .cse10 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)))))))) is different from false [2024-11-09 01:30:57,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_521 (_ BitVec 32)) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_519) c_~var_1_8_Pointer~0.base v_ArrVal_520))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store .cse8 c_~var_1_9_Pointer~0.base v_ArrVal_524))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select (store .cse8 c_~var_1_9_Pointer~0.base (store (select .cse8 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_521)) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) c_~var_1_1_Pointer~0.base v_ArrVal_525))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)) (let ((.cse9 (let ((.cse10 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse10 .cse6) (select .cse10 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))))))) is different from false [2024-11-09 01:30:57,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_521 (_ BitVec 32)) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_518) c_~var_1_14_Pointer~0.base v_ArrVal_519) c_~var_1_8_Pointer~0.base v_ArrVal_520))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store .cse10 c_~var_1_9_Pointer~0.base v_ArrVal_524))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_521)) c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) c_~var_1_1_Pointer~0.base v_ArrVal_525))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))))) is different from false [2024-11-09 01:31:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1830509886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372867092] [2024-11-09 01:31:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:00,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:31:00,393 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:31:00,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 01:31:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 01:31:01,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:01,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-09 01:31:06,753 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 22 treesize of output 1 [2024-11-09 01:31:14,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2024-11-09 01:31:14,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2024-11-09 01:31:15,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2024-11-09 01:31:16,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2024-11-09 01:31:16,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 98 [2024-11-09 01:31:16,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 01:31:16,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 01:31:18,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 89 [2024-11-09 01:31:19,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:19,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 110 [2024-11-09 01:31:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:31:20,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:21,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_555 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_82| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_555)))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_82|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_82|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_82|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 01:31:21,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_555 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_82| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (let ((.cse10 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_551))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_555))))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_82|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_82|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_82|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 01:31:21,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_555 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_82| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_550) c_~var_1_8_Pointer~0.base v_ArrVal_551))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_555))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_82|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_82|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_82|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:31:22,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_555 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_82| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_549) c_~var_1_14_Pointer~0.base v_ArrVal_550) c_~var_1_8_Pointer~0.base v_ArrVal_551))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_555))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_82|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_82|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_82|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_82|))) c_~var_1_1_Pointer~0.base v_ArrVal_496))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:31:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372867092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:25,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:31:25,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 46 [2024-11-09 01:31:25,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437718487] [2024-11-09 01:31:25,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:31:25,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 01:31:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:31:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 01:31:25,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2387, Unknown=35, NotChecked=1456, Total=4160 [2024-11-09 01:31:25,815 INFO L87 Difference]: Start difference. First operand 248 states and 321 transitions. Second operand has 47 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 43 states have internal predecessors, (119), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 01:31:32,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:31:42,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:31:44,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:31:58,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:00,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:02,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:04,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:06,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:08,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:10,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:41,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:43,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:45,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:47,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:49,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:51,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:14,538 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 [0] [2024-11-09 01:33:16,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:18,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:20,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:22,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:24,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:27,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:29,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:31,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:33,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:35,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:37,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:40,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:42,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:44,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:46,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:48,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:50,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:53,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:55,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:57,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:59,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:01,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:03,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:05,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:07,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:09,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:11,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:13,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:15,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:19,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:26,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:30,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:33,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:46,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:48,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:50,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:53,042 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 [0] [2024-11-09 01:34:55,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:57,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:34:59,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:01,531 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 [0] [2024-11-09 01:35:03,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:05,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:07,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:09,790 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 [0] [2024-11-09 01:35:12,205 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 [0] [2024-11-09 01:35:15,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:17,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:19,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:21,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:23,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:25,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:27,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:29,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:31,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:33,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:35,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:37,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:39,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:41,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:43,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:45,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:47,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:49,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:52,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:54,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:56,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:35:58,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:00,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:02,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:05,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:07,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:09,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:11,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:11,245 INFO L93 Difference]: Finished difference Result 691 states and 874 transitions. [2024-11-09 01:36:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-09 01:36:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 43 states have internal predecessors, (119), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 64 [2024-11-09 01:36:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:11,251 INFO L225 Difference]: With dead ends: 691 [2024-11-09 01:36:11,251 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 01:36:11,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 105.3s TimeCoverageRelationStatistics Valid=994, Invalid=7009, Unknown=59, NotChecked=2444, Total=10506 [2024-11-09 01:36:11,263 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1463 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 271 mSolverCounterUnsat, 88 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 210.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 88 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 211.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:11,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 1450 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2413 Invalid, 88 Unknown, 0 Unchecked, 211.8s Time] [2024-11-09 01:36:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 01:36:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2024-11-09 01:36:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 357 states have (on average 1.2773109243697478) internal successors, (456), 358 states have internal predecessors, (456), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:36:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 488 transitions. [2024-11-09 01:36:11,330 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 488 transitions. Word has length 64 [2024-11-09 01:36:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:11,330 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 488 transitions. [2024-11-09 01:36:11,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 43 states have internal predecessors, (119), 6 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 01:36:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 488 transitions. [2024-11-09 01:36:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:36:11,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:11,332 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:11,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:11,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-09 01:36:11,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 (21)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:11,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:11,937 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:11,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -373201928, now seen corresponding path program 1 times [2024-11-09 01:36:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466135389] [2024-11-09 01:36:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:11,938 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 01:36:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:11,942 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:11,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 01:36:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:12,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:36:12,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 01:36:12,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:12,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:36:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466135389] [2024-11-09 01:36:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466135389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655081008] [2024-11-09 01:36:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:36:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:36:12,419 INFO L87 Difference]: Start difference. First operand 382 states and 488 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:36:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:12,934 INFO L93 Difference]: Finished difference Result 609 states and 773 transitions. [2024-11-09 01:36:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:36:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-11-09 01:36:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:12,940 INFO L225 Difference]: With dead ends: 609 [2024-11-09 01:36:12,947 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 01:36:12,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:12,949 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:12,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:36:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 01:36:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2024-11-09 01:36:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 271 states have (on average 1.2435424354243543) internal successors, (337), 272 states have internal predecessors, (337), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:36:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 365 transitions. [2024-11-09 01:36:13,008 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 365 transitions. Word has length 64 [2024-11-09 01:36:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:13,008 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 365 transitions. [2024-11-09 01:36:13,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:36:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 365 transitions. [2024-11-09 01:36:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:36:13,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:13,009 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:13,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-09 01:36:13,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:13,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1789383983, now seen corresponding path program 1 times [2024-11-09 01:36:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:13,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656120980] [2024-11-09 01:36:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:13,211 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 01:36:13,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:13,215 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:13,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 (25)] Waiting until timeout for monitored process [2024-11-09 01:36:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:13,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:36:13,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:13,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:13,588 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 91 treesize of output 31 [2024-11-09 01:36:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:36:13,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:13,721 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:36:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656120980] [2024-11-09 01:36:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656120980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:13,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:13,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:36:13,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498947419] [2024-11-09 01:36:13,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:13,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:36:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:36:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:36:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:36:13,724 INFO L87 Difference]: Start difference. First operand 294 states and 365 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:36:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:13,878 INFO L93 Difference]: Finished difference Result 524 states and 652 transitions. [2024-11-09 01:36:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:36:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-09 01:36:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:13,881 INFO L225 Difference]: With dead ends: 524 [2024-11-09 01:36:13,881 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 01:36:13,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:36:13,883 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:13,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 01:36:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-09 01:36:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 271 states have (on average 1.2214022140221403) internal successors, (331), 272 states have internal predecessors, (331), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:36:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2024-11-09 01:36:13,922 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 67 [2024-11-09 01:36:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:13,922 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2024-11-09 01:36:13,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:36:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2024-11-09 01:36:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:36:13,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:13,924 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:13,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 (25)] Ended with exit code 0 [2024-11-09 01:36:14,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:14,126 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:14,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 700144979, now seen corresponding path program 1 times [2024-11-09 01:36:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:14,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806119203] [2024-11-09 01:36:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:14,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:36:14,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:14,129 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:14,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 01:36:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:14,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 01:36:14,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:15,486 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 01:36:17,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:36:18,882 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 01:36:20,113 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 01:36:20,383 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 01:36:20,498 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 01:36:20,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 01:36:20,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:36:20,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 01:36:21,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2024-11-09 01:36:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:36:21,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:36:22,647 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:36:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806119203] [2024-11-09 01:36:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806119203] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-11-09 01:36:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106187356] [2024-11-09 01:36:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:22,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:36:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:36:22,656 INFO L87 Difference]: Start difference. First operand 294 states and 359 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:36:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:24,217 INFO L93 Difference]: Finished difference Result 460 states and 566 transitions. [2024-11-09 01:36:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:36:24,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-09 01:36:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:24,223 INFO L225 Difference]: With dead ends: 460 [2024-11-09 01:36:24,223 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 01:36:24,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:36:24,224 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:24,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 293 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 01:36:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 01:36:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2024-11-09 01:36:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 275 states have (on average 1.2181818181818183) internal successors, (335), 276 states have internal predecessors, (335), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:36:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2024-11-09 01:36:24,261 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 67 [2024-11-09 01:36:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:24,262 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2024-11-09 01:36:24,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:36:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2024-11-09 01:36:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 01:36:24,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:24,264 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:24,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-09 01:36:24,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:24,465 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:24,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 52151864, now seen corresponding path program 1 times [2024-11-09 01:36:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:24,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206261777] [2024-11-09 01:36:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:24,466 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 01:36:24,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:24,467 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:24,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-09 01:36:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:24,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:36:24,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:24,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:24,839 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 91 treesize of output 31 [2024-11-09 01:36:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:36:24,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:24,930 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:36:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206261777] [2024-11-09 01:36:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206261777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:24,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:36:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359998732] [2024-11-09 01:36:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:36:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:36:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:36:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:24,932 INFO L87 Difference]: Start difference. First operand 298 states and 363 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:36:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:25,531 INFO L93 Difference]: Finished difference Result 470 states and 570 transitions. [2024-11-09 01:36:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:36:25,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-11-09 01:36:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:25,535 INFO L225 Difference]: With dead ends: 470 [2024-11-09 01:36:25,536 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 01:36:25,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:36:25,537 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:25,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:36:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 01:36:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-09 01:36:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 251 states have (on average 1.1912350597609562) internal successors, (299), 252 states have internal predecessors, (299), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:36:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 327 transitions. [2024-11-09 01:36:25,580 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 327 transitions. Word has length 69 [2024-11-09 01:36:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:25,581 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 327 transitions. [2024-11-09 01:36:25,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:36:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 327 transitions. [2024-11-09 01:36:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:36:25,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:25,584 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:25,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-09 01:36:25,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:25,785 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:25,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash -470204484, now seen corresponding path program 1 times [2024-11-09 01:36:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799600245] [2024-11-09 01:36:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:25,787 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 01:36:25,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:25,790 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/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 01:36:25,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87414cf5-6788-4a98-b030-5e08fb45e887/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-09 01:36:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:26,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 01:36:26,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:27,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:36:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:36:33,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:36:33,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:36:33,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-09 01:36:33,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:36:33,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 01:36:36,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:36:40,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:36:41,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 01:36:41,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-09 01:36:41,853 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 54 treesize of output 46 [2024-11-09 01:36:42,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-09 01:36:42,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 53 [2024-11-09 01:36:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 9 proven. 128 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 01:36:43,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:43,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_702))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))))))) is different from false [2024-11-09 01:36:45,227 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_8_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store |c_#memory_int| c_~var_1_8_Pointer~0.base (store (select |c_#memory_int| c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) (select (select |c_#memory_int| c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))))) c_~var_1_9_Pointer~0.base v_ArrVal_700) c_~var_1_10_Pointer~0.base v_ArrVal_701) c_~var_1_1_Pointer~0.base v_ArrVal_702))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))))))) is different from false [2024-11-09 01:36:47,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_8_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))) (let ((.cse1 (store |c_#memory_int| c_~var_1_14_Pointer~0.base (store (select |c_#memory_int| c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset .cse2)))) (store .cse1 c_~var_1_8_Pointer~0.base (store (select .cse1 c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) .cse2))))))) c_~var_1_9_Pointer~0.base v_ArrVal_700) c_~var_1_10_Pointer~0.base v_ArrVal_701) c_~var_1_1_Pointer~0.base v_ArrVal_702))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) (select (select .cse0 c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)))))) is different from false [2024-11-09 01:36:48,802 INFO L349 Elim1Store]: treesize reduction 170, result has 40.6 percent of original size [2024-11-09 01:36:48,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 571 treesize of output 252 [2024-11-09 01:36:49,907 INFO L349 Elim1Store]: treesize reduction 40, result has 38.5 percent of original size [2024-11-09 01:36:49,909 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 7 case distinctions, treesize of input 909387 treesize of output 884810 [2024-11-09 01:36:52,776 INFO L349 Elim1Store]: treesize reduction 11, result has 67.6 percent of original size [2024-11-09 01:36:52,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1818682 treesize of output 1720388 [2024-11-09 01:36:55,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:55,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28030 treesize of output 24982 [2024-11-09 01:36:56,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:56,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24958 treesize of output 24214 [2024-11-09 01:36:56,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:56,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24190 treesize of output 22678 [2024-11-09 01:37:58,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11150 treesize of output 11020 [2024-11-09 01:38:50,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:38:50,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3152 treesize of output 3038 [2024-11-09 01:39:28,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1618 treesize of output 1558 [2024-11-09 01:39:56,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:39:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5175 treesize of output 4995