./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/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_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:59:48,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:59:48,902 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:59:48,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:59:48,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:59:48,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:59:48,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:59:48,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:59:48,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:59:48,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:59:48,966 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:59:48,966 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:59:48,967 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:59:48,967 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:59:48,968 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:59:48,968 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:59:48,969 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:59:48,969 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:59:48,970 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:59:48,970 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:59:48,971 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:59:48,975 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:59:48,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:59:48,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:59:48,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:59:48,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:59:48,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:59:48,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:59:48,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:59:48,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:59:48,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:59:48,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:59:48,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:59:48,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:59:48,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:59:48,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:59:48,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:59:48,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:59:48,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:59:48,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:59:48,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:59:48,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:59:48,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:59:48,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:59:48,990 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:59:48,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:59:48,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:59:48,991 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:59:48,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:59:48,992 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_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/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_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-09 04:59:49,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:59:49,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:59:49,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:59:49,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:59:49,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:59:49,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i Unable to find full path for "g++" [2024-11-09 04:59:51,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:59:51,957 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:59:51,958 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-11-09 04:59:51,991 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/data/3b7b2cbee/95464e9074ce413a87b86b6427ce0028/FLAG4e5ccf0fa [2024-11-09 04:59:52,014 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/data/3b7b2cbee/95464e9074ce413a87b86b6427ce0028 [2024-11-09 04:59:52,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:59:52,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:59:52,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:59:52,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:59:52,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:59:52,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:59:52" (1/1) ... [2024-11-09 04:59:52,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7559de71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:52, skipping insertion in model container [2024-11-09 04:59:52,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:59:52" (1/1) ... [2024-11-09 04:59:52,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:59:52,808 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:52,882 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:52,925 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:52,940 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:52,960 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:53,049 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:53,050 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:53,057 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:53,057 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:53,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:59:53,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:59:53,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:59:53,296 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:59:53,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53 WrapperNode [2024-11-09 04:59:53,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:59:53,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:59:53,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:59:53,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:59:53,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,435 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-09 04:59:53,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:59:53,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:59:53,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:59:53,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:59:53,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:59:53,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:59:53,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:59:53,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:59:53,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (1/1) ... [2024-11-09 04:59:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:59:53,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:59:53,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:59:53,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:59:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 04:59:53,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 04:59:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:59:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:59:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:59:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:59:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:59:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:59:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:59:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:59:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:59:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:59:53,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:59:53,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:59:53,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:59:53,987 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 04:59:56,906 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2024-11-09 04:59:56,907 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:59:58,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:59:58,739 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-09 04:59:58,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:59:58 BoogieIcfgContainer [2024-11-09 04:59:58,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:59:58,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:59:58,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:59:58,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:59:58,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:59:52" (1/3) ... [2024-11-09 04:59:58,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3b912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:59:58, skipping insertion in model container [2024-11-09 04:59:58,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:53" (2/3) ... [2024-11-09 04:59:58,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3b912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:59:58, skipping insertion in model container [2024-11-09 04:59:58,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:59:58" (3/3) ... [2024-11-09 04:59:58,754 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2024-11-09 04:59:58,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:59:58,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-09 04:59:58,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:59:58,885 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=None, 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;@2c992ae1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:59:58,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-09 04:59:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 777 states, 355 states have (on average 2.4704225352112674) internal successors, (877), 772 states have internal predecessors, (877), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:59:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 04:59:58,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:59:58,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 04:59:58,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 04:59:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:59:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2017653, now seen corresponding path program 1 times [2024-11-09 04:59:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:59:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177213573] [2024-11-09 04:59:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:59:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:59:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:59:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:59:59,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:59:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177213573] [2024-11-09 04:59:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177213573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:59:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:59:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 04:59:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412757349] [2024-11-09 04:59:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:59:59,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:59:59,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:59:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:59:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:59:59,273 INFO L87 Difference]: Start difference. First operand has 777 states, 355 states have (on average 2.4704225352112674) internal successors, (877), 772 states have internal predecessors, (877), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:01,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:03,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:05,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:07,188 INFO L93 Difference]: Finished difference Result 764 states and 816 transitions. [2024-11-09 05:00:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:07,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 05:00:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:07,207 INFO L225 Difference]: With dead ends: 764 [2024-11-09 05:00:07,207 INFO L226 Difference]: Without dead ends: 763 [2024-11-09 05:00:07,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 05:00:07,212 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 708 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:07,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 451 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 450 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2024-11-09 05:00:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-09 05:00:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2024-11-09 05:00:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 358 states have (on average 2.2597765363128492) internal successors, (809), 758 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:00:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 815 transitions. [2024-11-09 05:00:07,325 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 815 transitions. Word has length 3 [2024-11-09 05:00:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:07,325 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 815 transitions. [2024-11-09 05:00:07,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 815 transitions. [2024-11-09 05:00:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:00:07,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:07,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:00:07,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:00:07,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:00:07,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2017654, now seen corresponding path program 1 times [2024-11-09 05:00:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595063118] [2024-11-09 05:00:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:07,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:07,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595063118] [2024-11-09 05:00:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595063118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:07,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:07,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:00:07,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147833374] [2024-11-09 05:00:07,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:07,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:07,556 INFO L87 Difference]: Start difference. First operand 763 states and 815 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:09,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:11,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:12,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:14,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:16,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:18,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:20,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:22,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:22,981 INFO L93 Difference]: Finished difference Result 956 states and 1031 transitions. [2024-11-09 05:00:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:22,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 05:00:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:22,986 INFO L225 Difference]: With dead ends: 956 [2024-11-09 05:00:22,986 INFO L226 Difference]: Without dead ends: 956 [2024-11-09 05:00:22,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 05:00:22,988 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 216 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:22,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1025 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 578 Invalid, 5 Unknown, 0 Unchecked, 15.3s Time] [2024-11-09 05:00:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-09 05:00:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 870. [2024-11-09 05:00:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 466 states have (on average 2.1931330472103006) internal successors, (1022), 865 states have internal predecessors, (1022), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:00:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1028 transitions. [2024-11-09 05:00:23,013 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1028 transitions. Word has length 3 [2024-11-09 05:00:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:23,014 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1028 transitions. [2024-11-09 05:00:23,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1028 transitions. [2024-11-09 05:00:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:00:23,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:23,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:00:23,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:00:23,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:00:23,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2019630, now seen corresponding path program 1 times [2024-11-09 05:00:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377613118] [2024-11-09 05:00:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:23,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377613118] [2024-11-09 05:00:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377613118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040699474] [2024-11-09 05:00:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:23,119 INFO L87 Difference]: Start difference. First operand 870 states and 1028 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:25,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:27,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:29,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:31,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:33,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:35,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:37,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:39,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:41,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:44,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:45,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:47,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:48,382 INFO L93 Difference]: Finished difference Result 957 states and 1031 transitions. [2024-11-09 05:00:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 05:00:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:48,388 INFO L225 Difference]: With dead ends: 957 [2024-11-09 05:00:48,388 INFO L226 Difference]: Without dead ends: 955 [2024-11-09 05:00:48,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 05:00:48,390 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 217 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:48,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1415 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 987 Invalid, 11 Unknown, 0 Unchecked, 25.2s Time] [2024-11-09 05:00:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-09 05:00:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 870. [2024-11-09 05:00:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 466 states have (on average 2.188841201716738) internal successors, (1020), 865 states have internal predecessors, (1020), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:00:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1026 transitions. [2024-11-09 05:00:48,415 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1026 transitions. Word has length 3 [2024-11-09 05:00:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1026 transitions. [2024-11-09 05:00:48,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1026 transitions. [2024-11-09 05:00:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:00:48,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:48,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:00:48,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:00:48,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:00:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -21578373, now seen corresponding path program 1 times [2024-11-09 05:00:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879527246] [2024-11-09 05:00:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:48,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879527246] [2024-11-09 05:00:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879527246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:48,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608612479] [2024-11-09 05:00:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:48,771 INFO L87 Difference]: Start difference. First operand 870 states and 1026 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:51,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:53,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:55,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:57,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:00:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:58,062 INFO L93 Difference]: Finished difference Result 859 states and 1014 transitions. [2024-11-09 05:00:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 05:00:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:58,067 INFO L225 Difference]: With dead ends: 859 [2024-11-09 05:00:58,067 INFO L226 Difference]: Without dead ends: 859 [2024-11-09 05:00:58,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:58,069 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 781 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 17 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:58,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 225 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 656 Invalid, 4 Unknown, 0 Unchecked, 9.2s Time] [2024-11-09 05:00:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-09 05:00:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2024-11-09 05:00:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 466 states have (on average 2.163090128755365) internal successors, (1008), 854 states have internal predecessors, (1008), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:00:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1014 transitions. [2024-11-09 05:00:58,093 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1014 transitions. Word has length 6 [2024-11-09 05:00:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:58,094 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1014 transitions. [2024-11-09 05:00:58,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1014 transitions. [2024-11-09 05:00:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:00:58,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:58,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:58,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:00:58,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:00:58,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash -668929584, now seen corresponding path program 1 times [2024-11-09 05:00:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092251715] [2024-11-09 05:00:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:58,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092251715] [2024-11-09 05:00:58,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092251715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:58,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:58,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139047266] [2024-11-09 05:00:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:58,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:58,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:58,209 INFO L87 Difference]: Start difference. First operand 859 states and 1014 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:01,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:03,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:05,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:07,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:09,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:11,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:11,935 INFO L93 Difference]: Finished difference Result 897 states and 969 transitions. [2024-11-09 05:01:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:01:11,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:01:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:11,941 INFO L225 Difference]: With dead ends: 897 [2024-11-09 05:01:11,941 INFO L226 Difference]: Without dead ends: 897 [2024-11-09 05:01:11,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:01:11,943 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 676 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:11,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 657 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 574 Invalid, 5 Unknown, 0 Unchecked, 13.7s Time] [2024-11-09 05:01:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-09 05:01:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 812. [2024-11-09 05:01:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 466 states have (on average 2.0622317596566524) internal successors, (961), 807 states have internal predecessors, (961), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:01:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 967 transitions. [2024-11-09 05:01:11,966 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 967 transitions. Word has length 7 [2024-11-09 05:01:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:11,967 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 967 transitions. [2024-11-09 05:01:11,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 967 transitions. [2024-11-09 05:01:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:01:11,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:11,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:01:11,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:01:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -668929583, now seen corresponding path program 1 times [2024-11-09 05:01:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170387467] [2024-11-09 05:01:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:12,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:12,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170387467] [2024-11-09 05:01:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170387467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:12,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:01:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269029863] [2024-11-09 05:01:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:12,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:01:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:01:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:01:12,056 INFO L87 Difference]: Start difference. First operand 812 states and 967 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:14,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:16,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:18,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:20,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:22,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:24,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:26,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:28,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:28,955 INFO L93 Difference]: Finished difference Result 984 states and 1161 transitions. [2024-11-09 05:01:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:01:28,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:01:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:28,959 INFO L225 Difference]: With dead ends: 984 [2024-11-09 05:01:28,960 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 05:01:28,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:01:28,961 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 499 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 26 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:28,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 853 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 517 Invalid, 8 Unknown, 0 Unchecked, 16.9s Time] [2024-11-09 05:01:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 05:01:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 787. [2024-11-09 05:01:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 466 states have (on average 2.0085836909871246) internal successors, (936), 782 states have internal predecessors, (936), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:01:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 942 transitions. [2024-11-09 05:01:28,981 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 942 transitions. Word has length 7 [2024-11-09 05:01:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:28,982 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 942 transitions. [2024-11-09 05:01:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 942 transitions. [2024-11-09 05:01:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:01:28,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:28,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:01:28,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:01:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 538357402, now seen corresponding path program 1 times [2024-11-09 05:01:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23563077] [2024-11-09 05:01:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:29,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23563077] [2024-11-09 05:01:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23563077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:01:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284064526] [2024-11-09 05:01:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:01:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:01:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:29,052 INFO L87 Difference]: Start difference. First operand 787 states and 942 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:30,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:33,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:35,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:37,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:39,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:40,482 INFO L93 Difference]: Finished difference Result 772 states and 904 transitions. [2024-11-09 05:01:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:01:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:01:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:40,486 INFO L225 Difference]: With dead ends: 772 [2024-11-09 05:01:40,486 INFO L226 Difference]: Without dead ends: 772 [2024-11-09 05:01:40,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:01:40,488 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 680 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 29 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:40,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 682 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 723 Invalid, 4 Unknown, 0 Unchecked, 11.4s Time] [2024-11-09 05:01:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-09 05:01:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2024-11-09 05:01:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 466 states have (on average 1.909871244635193) internal successors, (890), 759 states have internal predecessors, (890), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:01:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 896 transitions. [2024-11-09 05:01:40,507 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 896 transitions. Word has length 14 [2024-11-09 05:01:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:40,507 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 896 transitions. [2024-11-09 05:01:40,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 896 transitions. [2024-11-09 05:01:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:01:40,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:40,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:01:40,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:01:40,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 538357403, now seen corresponding path program 1 times [2024-11-09 05:01:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736976939] [2024-11-09 05:01:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:40,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736976939] [2024-11-09 05:01:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736976939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:40,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:01:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879829398] [2024-11-09 05:01:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:40,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:01:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:01:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:40,715 INFO L87 Difference]: Start difference. First operand 764 states and 896 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:43,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:45,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:47,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:49,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:51,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:53,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:56,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:01:58,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:00,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:02,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:02,528 INFO L93 Difference]: Finished difference Result 805 states and 869 transitions. [2024-11-09 05:02:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:02:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:02,532 INFO L225 Difference]: With dead ends: 805 [2024-11-09 05:02:02,532 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 05:02:02,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:02,534 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 200 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 15 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:02,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1186 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 899 Invalid, 9 Unknown, 0 Unchecked, 21.7s Time] [2024-11-09 05:02:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 05:02:02,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 754. [2024-11-09 05:02:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 456 states have (on average 1.8793859649122806) internal successors, (857), 749 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:02:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 863 transitions. [2024-11-09 05:02:02,553 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 863 transitions. Word has length 14 [2024-11-09 05:02:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:02,553 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 863 transitions. [2024-11-09 05:02:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 863 transitions. [2024-11-09 05:02:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:02:02,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:02,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:02:02,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:02:02,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -484018869, now seen corresponding path program 1 times [2024-11-09 05:02:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:02,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273988555] [2024-11-09 05:02:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:02,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:02,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273988555] [2024-11-09 05:02:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273988555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:02,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:02,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:02:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331053851] [2024-11-09 05:02:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:02,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:02:02,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:02,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:02:02,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:02,632 INFO L87 Difference]: Start difference. First operand 754 states and 863 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:06,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:08,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:10,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:12,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:16,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:18,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:20,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:22,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:24,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:25,022 INFO L93 Difference]: Finished difference Result 739 states and 834 transitions. [2024-11-09 05:02:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:25,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:02:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:25,026 INFO L225 Difference]: With dead ends: 739 [2024-11-09 05:02:25,026 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 05:02:25,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:25,027 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 67 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 16 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:25,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1668 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 274 Invalid, 11 Unknown, 0 Unchecked, 22.4s Time] [2024-11-09 05:02:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 05:02:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 733. [2024-11-09 05:02:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 442 states have (on average 1.8597285067873304) internal successors, (822), 728 states have internal predecessors, (822), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:02:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 828 transitions. [2024-11-09 05:02:25,040 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 828 transitions. Word has length 15 [2024-11-09 05:02:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:25,041 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 828 transitions. [2024-11-09 05:02:25,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 828 transitions. [2024-11-09 05:02:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:02:25,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:25,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:02:25,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:02:25,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1289790689, now seen corresponding path program 1 times [2024-11-09 05:02:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136032402] [2024-11-09 05:02:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:25,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136032402] [2024-11-09 05:02:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136032402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:02:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966737925] [2024-11-09 05:02:25,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:25,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:02:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:25,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:02:25,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:25,108 INFO L87 Difference]: Start difference. First operand 733 states and 828 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:27,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:29,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:31,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:33,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:35,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:38,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:40,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:41,241 INFO L93 Difference]: Finished difference Result 754 states and 811 transitions. [2024-11-09 05:02:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:02:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:41,244 INFO L225 Difference]: With dead ends: 754 [2024-11-09 05:02:41,245 INFO L226 Difference]: Without dead ends: 754 [2024-11-09 05:02:41,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:41,245 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 670 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 28 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:41,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 873 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 836 Invalid, 7 Unknown, 0 Unchecked, 16.1s Time] [2024-11-09 05:02:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-09 05:02:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 710. [2024-11-09 05:02:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 442 states have (on average 1.8076923076923077) internal successors, (799), 705 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:02:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 805 transitions. [2024-11-09 05:02:41,260 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 805 transitions. Word has length 16 [2024-11-09 05:02:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:41,260 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 805 transitions. [2024-11-09 05:02:41,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 805 transitions. [2024-11-09 05:02:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:02:41,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:41,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:41,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:02:41,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:02:41,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1289790690, now seen corresponding path program 1 times [2024-11-09 05:02:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:41,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077309977] [2024-11-09 05:02:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:41,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:41,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077309977] [2024-11-09 05:02:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077309977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:02:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764117055] [2024-11-09 05:02:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:41,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:02:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:41,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:02:41,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:02:41,365 INFO L87 Difference]: Start difference. First operand 710 states and 805 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:43,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:45,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:47,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:49,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:50,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:50,615 INFO L93 Difference]: Finished difference Result 682 states and 775 transitions. [2024-11-09 05:02:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:02:50,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:02:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:50,618 INFO L225 Difference]: With dead ends: 682 [2024-11-09 05:02:50,618 INFO L226 Difference]: Without dead ends: 682 [2024-11-09 05:02:50,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:02:50,619 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 51 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:50,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1032 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 4 Unknown, 0 Unchecked, 9.2s Time] [2024-11-09 05:02:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-09 05:02:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2024-11-09 05:02:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 426 states have (on average 1.8051643192488263) internal successors, (769), 677 states have internal predecessors, (769), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:02:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 775 transitions. [2024-11-09 05:02:50,636 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 775 transitions. Word has length 16 [2024-11-09 05:02:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:50,637 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 775 transitions. [2024-11-09 05:02:50,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 775 transitions. [2024-11-09 05:02:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:02:50,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:50,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:50,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:02:50,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:02:50,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1335575306, now seen corresponding path program 1 times [2024-11-09 05:02:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:50,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019461611] [2024-11-09 05:02:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:50,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019461611] [2024-11-09 05:02:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019461611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:50,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:02:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587219091] [2024-11-09 05:02:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:50,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:02:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:02:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:50,752 INFO L87 Difference]: Start difference. First operand 682 states and 775 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:02:52,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:54,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:56,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:02:58,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:00,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:02,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:04,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:05,048 INFO L93 Difference]: Finished difference Result 671 states and 757 transitions. [2024-11-09 05:03:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:03:05,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 05:03:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:05,051 INFO L225 Difference]: With dead ends: 671 [2024-11-09 05:03:05,051 INFO L226 Difference]: Without dead ends: 671 [2024-11-09 05:03:05,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:03:05,052 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 38 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 15 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:05,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1513 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 242 Invalid, 6 Unknown, 0 Unchecked, 14.3s Time] [2024-11-09 05:03:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-09 05:03:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 668. [2024-11-09 05:03:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 419 states have (on average 1.7852028639618138) internal successors, (748), 663 states have internal predecessors, (748), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 754 transitions. [2024-11-09 05:03:05,066 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 754 transitions. Word has length 17 [2024-11-09 05:03:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:05,067 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 754 transitions. [2024-11-09 05:03:05,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 754 transitions. [2024-11-09 05:03:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 05:03:05,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:05,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:05,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:03:05,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr339REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:03:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1008225209, now seen corresponding path program 1 times [2024-11-09 05:03:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655883170] [2024-11-09 05:03:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:05,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:05,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655883170] [2024-11-09 05:03:05,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655883170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:05,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:05,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:03:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884305482] [2024-11-09 05:03:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:03:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:03:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:03:05,142 INFO L87 Difference]: Start difference. First operand 668 states and 754 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:07,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:09,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:11,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:13,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:13,328 INFO L93 Difference]: Finished difference Result 634 states and 716 transitions. [2024-11-09 05:03:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:03:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 05:03:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:13,331 INFO L225 Difference]: With dead ends: 634 [2024-11-09 05:03:13,331 INFO L226 Difference]: Without dead ends: 634 [2024-11-09 05:03:13,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:03:13,332 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 30 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:13,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 966 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 8.2s Time] [2024-11-09 05:03:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-09 05:03:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-11-09 05:03:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 397 states have (on average 1.7884130982367759) internal successors, (710), 629 states have internal predecessors, (710), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 716 transitions. [2024-11-09 05:03:13,345 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 716 transitions. Word has length 18 [2024-11-09 05:03:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 716 transitions. [2024-11-09 05:03:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 716 transitions. [2024-11-09 05:03:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:03:13,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:13,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 05:03:13,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:03:13,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:03:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1020829944, now seen corresponding path program 1 times [2024-11-09 05:03:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109011083] [2024-11-09 05:03:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:13,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109011083] [2024-11-09 05:03:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109011083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:13,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:13,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:03:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299201812] [2024-11-09 05:03:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:13,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:03:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:03:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:03:13,558 INFO L87 Difference]: Start difference. First operand 634 states and 716 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:15,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:17,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:19,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:21,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:23,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:25,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:28,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:30,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:30,342 INFO L93 Difference]: Finished difference Result 766 states and 861 transitions. [2024-11-09 05:03:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:03:30,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 05:03:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:30,345 INFO L225 Difference]: With dead ends: 766 [2024-11-09 05:03:30,345 INFO L226 Difference]: Without dead ends: 766 [2024-11-09 05:03:30,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:03:30,346 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 361 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:30,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1008 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 8 Unknown, 0 Unchecked, 16.7s Time] [2024-11-09 05:03:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-09 05:03:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 630. [2024-11-09 05:03:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.778337531486146) internal successors, (706), 625 states have internal predecessors, (706), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 712 transitions. [2024-11-09 05:03:30,361 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 712 transitions. Word has length 31 [2024-11-09 05:03:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:30,362 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 712 transitions. [2024-11-09 05:03:30,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 712 transitions. [2024-11-09 05:03:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 05:03:30,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:30,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:03:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:03:30,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:03:30,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1327795383, now seen corresponding path program 1 times [2024-11-09 05:03:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799245416] [2024-11-09 05:03:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:30,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799245416] [2024-11-09 05:03:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799245416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:03:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784495844] [2024-11-09 05:03:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:30,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:03:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:03:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:03:30,519 INFO L87 Difference]: Start difference. First operand 630 states and 712 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:32,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:34,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:36,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:40,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:42,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:42,866 INFO L93 Difference]: Finished difference Result 630 states and 704 transitions. [2024-11-09 05:03:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:03:42,867 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 05:03:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:42,869 INFO L225 Difference]: With dead ends: 630 [2024-11-09 05:03:42,869 INFO L226 Difference]: Without dead ends: 630 [2024-11-09 05:03:42,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:03:42,870 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 21 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:42,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1417 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 12.3s Time] [2024-11-09 05:03:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-09 05:03:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-09 05:03:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.7581863979848866) internal successors, (698), 625 states have internal predecessors, (698), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 704 transitions. [2024-11-09 05:03:42,884 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 704 transitions. Word has length 43 [2024-11-09 05:03:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:42,884 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 704 transitions. [2024-11-09 05:03:42,884 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 704 transitions. [2024-11-09 05:03:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 05:03:42,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:42,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:03:42,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:03:42,886 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:03:42,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2019105032, now seen corresponding path program 1 times [2024-11-09 05:03:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:42,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484487623] [2024-11-09 05:03:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:43,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484487623] [2024-11-09 05:03:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484487623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:43,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:43,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:03:43,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454821471] [2024-11-09 05:03:43,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:43,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:03:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:03:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:03:43,011 INFO L87 Difference]: Start difference. First operand 630 states and 704 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:45,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:47,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:49,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:51,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:53,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:55,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:03:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:55,324 INFO L93 Difference]: Finished difference Result 699 states and 733 transitions. [2024-11-09 05:03:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:03:55,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 05:03:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:55,326 INFO L225 Difference]: With dead ends: 699 [2024-11-09 05:03:55,326 INFO L226 Difference]: Without dead ends: 699 [2024-11-09 05:03:55,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:03:55,327 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 68 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:55,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 951 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 12.3s Time] [2024-11-09 05:03:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-09 05:03:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 689. [2024-11-09 05:03:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 456 states have (on average 1.5855263157894737) internal successors, (723), 684 states have internal predecessors, (723), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 729 transitions. [2024-11-09 05:03:55,343 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 729 transitions. Word has length 47 [2024-11-09 05:03:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:55,344 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 729 transitions. [2024-11-09 05:03:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 729 transitions. [2024-11-09 05:03:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 05:03:55,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:55,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:03:55,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:03:55,346 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:03:55,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -262803330, now seen corresponding path program 1 times [2024-11-09 05:03:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244762102] [2024-11-09 05:03:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:56,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244762102] [2024-11-09 05:03:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244762102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:56,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:56,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:03:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132720019] [2024-11-09 05:03:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:56,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:03:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:03:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:56,108 INFO L87 Difference]: Start difference. First operand 689 states and 729 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:58,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:00,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:02,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:04,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:06,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:08,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:10,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:12,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:13,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:16,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:16,264 INFO L93 Difference]: Finished difference Result 777 states and 825 transitions. [2024-11-09 05:04:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:04:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 05:04:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:16,267 INFO L225 Difference]: With dead ends: 777 [2024-11-09 05:04:16,267 INFO L226 Difference]: Without dead ends: 774 [2024-11-09 05:04:16,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:04:16,268 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 137 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:16,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2849 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 9 Unknown, 0 Unchecked, 20.1s Time] [2024-11-09 05:04:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-09 05:04:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 640. [2024-11-09 05:04:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 407 states have (on average 1.651105651105651) internal successors, (672), 635 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 678 transitions. [2024-11-09 05:04:16,283 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 678 transitions. Word has length 53 [2024-11-09 05:04:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:16,283 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 678 transitions. [2024-11-09 05:04:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 678 transitions. [2024-11-09 05:04:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:04:16,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:16,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:04:16,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:04:16,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:04:16,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1249538531, now seen corresponding path program 1 times [2024-11-09 05:04:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:16,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123446461] [2024-11-09 05:04:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:04:16,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123446461] [2024-11-09 05:04:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123446461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:16,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:04:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591746551] [2024-11-09 05:04:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:04:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:04:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:04:16,438 INFO L87 Difference]: Start difference. First operand 640 states and 678 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:18,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:20,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:22,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:24,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:25,009 INFO L93 Difference]: Finished difference Result 640 states and 670 transitions. [2024-11-09 05:04:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:04:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 05:04:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:25,011 INFO L225 Difference]: With dead ends: 640 [2024-11-09 05:04:25,012 INFO L226 Difference]: Without dead ends: 640 [2024-11-09 05:04:25,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:04:25,012 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 15 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:25,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1411 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 234 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2024-11-09 05:04:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-09 05:04:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2024-11-09 05:04:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 407 states have (on average 1.6314496314496314) internal successors, (664), 635 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 670 transitions. [2024-11-09 05:04:25,026 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 670 transitions. Word has length 54 [2024-11-09 05:04:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:25,027 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 670 transitions. [2024-11-09 05:04:25,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 670 transitions. [2024-11-09 05:04:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 05:04:25,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:25,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:04:25,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:04:25,028 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:04:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1096741378, now seen corresponding path program 1 times [2024-11-09 05:04:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073710576] [2024-11-09 05:04:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:04:25,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073710576] [2024-11-09 05:04:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073710576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:04:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931303754] [2024-11-09 05:04:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:04:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:25,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:04:25,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:04:25,496 INFO L87 Difference]: Start difference. First operand 640 states and 670 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:27,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:28,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:31,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:33,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:34,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:34,720 INFO L93 Difference]: Finished difference Result 639 states and 669 transitions. [2024-11-09 05:04:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:04:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-09 05:04:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:34,722 INFO L225 Difference]: With dead ends: 639 [2024-11-09 05:04:34,722 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 05:04:34,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:04:34,723 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:34,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1306 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 923 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2024-11-09 05:04:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 05:04:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-11-09 05:04:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 407 states have (on average 1.628992628992629) internal successors, (663), 634 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 669 transitions. [2024-11-09 05:04:34,735 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 669 transitions. Word has length 58 [2024-11-09 05:04:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:34,736 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 669 transitions. [2024-11-09 05:04:34,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 669 transitions. [2024-11-09 05:04:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 05:04:34,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:34,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:04:34,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:04:34,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:04:34,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1096741379, now seen corresponding path program 1 times [2024-11-09 05:04:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:34,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522847102] [2024-11-09 05:04:34,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:34,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:04:35,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522847102] [2024-11-09 05:04:35,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522847102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:35,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:35,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:04:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176309628] [2024-11-09 05:04:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:35,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:04:35,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:35,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:04:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:04:35,469 INFO L87 Difference]: Start difference. First operand 639 states and 669 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:37,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:39,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:41,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:43,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:45,385 INFO L93 Difference]: Finished difference Result 638 states and 668 transitions. [2024-11-09 05:04:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:04:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-09 05:04:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:45,388 INFO L225 Difference]: With dead ends: 638 [2024-11-09 05:04:45,388 INFO L226 Difference]: Without dead ends: 638 [2024-11-09 05:04:45,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:04:45,389 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 1 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:45,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1265 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 960 Invalid, 4 Unknown, 0 Unchecked, 9.9s Time] [2024-11-09 05:04:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-09 05:04:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-09 05:04:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 406 states have (on average 1.6305418719211822) internal successors, (662), 633 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 668 transitions. [2024-11-09 05:04:45,403 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 668 transitions. Word has length 58 [2024-11-09 05:04:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:45,404 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 668 transitions. [2024-11-09 05:04:45,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:04:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 668 transitions. [2024-11-09 05:04:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:04:45,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:45,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:04:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 05:04:45,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:04:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -122344952, now seen corresponding path program 1 times [2024-11-09 05:04:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605883951] [2024-11-09 05:04:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:04:45,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605883951] [2024-11-09 05:04:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605883951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:04:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487235772] [2024-11-09 05:04:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:45,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:04:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:45,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:04:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:04:45,777 INFO L87 Difference]: Start difference. First operand 638 states and 668 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:04:47,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:49,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:51,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:53,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:55,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:57,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:00,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:02,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:03,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:03,791 INFO L93 Difference]: Finished difference Result 648 states and 681 transitions. [2024-11-09 05:05:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:05:03,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-09 05:05:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:03,796 INFO L225 Difference]: With dead ends: 648 [2024-11-09 05:05:03,796 INFO L226 Difference]: Without dead ends: 648 [2024-11-09 05:05:03,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:05:03,797 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 5 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:03,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1796 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 990 Invalid, 8 Unknown, 0 Unchecked, 18.0s Time] [2024-11-09 05:05:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-09 05:05:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 643. [2024-11-09 05:05:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 410 states have (on average 1.6292682926829267) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:05:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 677 transitions. [2024-11-09 05:05:03,818 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 677 transitions. Word has length 64 [2024-11-09 05:05:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 677 transitions. [2024-11-09 05:05:03,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:05:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 677 transitions. [2024-11-09 05:05:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:05:03,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:03,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:05:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 05:05:03,821 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:05:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -122344951, now seen corresponding path program 1 times [2024-11-09 05:05:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43555545] [2024-11-09 05:05:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:04,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:04,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43555545] [2024-11-09 05:05:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43555545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:04,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:05:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342956938] [2024-11-09 05:05:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:04,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:04,561 INFO L87 Difference]: Start difference. First operand 643 states and 677 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:05:07,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:09,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:11,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:13,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:15,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:16,014 INFO L93 Difference]: Finished difference Result 643 states and 676 transitions. [2024-11-09 05:05:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:05:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-09 05:05:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:16,017 INFO L225 Difference]: With dead ends: 643 [2024-11-09 05:05:16,017 INFO L226 Difference]: Without dead ends: 643 [2024-11-09 05:05:16,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:16,018 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 1 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:16,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1663 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1118 Invalid, 5 Unknown, 0 Unchecked, 11.4s Time] [2024-11-09 05:05:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-09 05:05:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2024-11-09 05:05:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 410 states have (on average 1.6268292682926828) internal successors, (667), 637 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:05:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 676 transitions. [2024-11-09 05:05:16,032 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 676 transitions. Word has length 64 [2024-11-09 05:05:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:16,033 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 676 transitions. [2024-11-09 05:05:16,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:05:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 676 transitions. [2024-11-09 05:05:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 05:05:16,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:16,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:05:16,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 05:05:16,035 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:05:16,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1646320683, now seen corresponding path program 1 times [2024-11-09 05:05:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190709950] [2024-11-09 05:05:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:16,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190709950] [2024-11-09 05:05:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190709950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759609059] [2024-11-09 05:05:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:16,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:05:16,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:05:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:17,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 05:05:17,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:17,125 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 6 treesize of output 5 [2024-11-09 05:05:17,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:05:17,249 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 11 treesize of output 11 [2024-11-09 05:05:17,264 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 1 [2024-11-09 05:05:17,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:05:17,334 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 05:05:17,371 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 31 treesize of output 13 [2024-11-09 05:05:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:17,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:05:17,432 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 05:05:17,433 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 21 treesize of output 20 [2024-11-09 05:05:17,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem54#1.base|)) is different from false [2024-11-09 05:05:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759609059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216239099] [2024-11-09 05:05:17,466 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-09 05:05:17,466 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:05:17,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:05:17,476 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:05:17,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:05:24,682 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:05:25,017 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:08:45,103 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33372#(and (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_18|))) (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_423| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_420|) (= (store |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_3|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_423|) (= (store |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_422|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#valid_631| (Array Int Int)) (|v_#length_613| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (<= 40 (select |v_#length_613| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (select |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (select |v_#valid_631| |ULTIMATE.start_main_~user~0#1.base|) 1) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|) (= (store |v_#length_613| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32))))))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_18|))) (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_423| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_420|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_423|) (= (store |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_422|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#valid_631| (Array Int Int)) (|v_#length_613| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= 40 (select |v_#length_613| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (store |v_#length_613| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (select |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_631| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|))))) (= |ULTIMATE.start_main_#t~mem56#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-09 05:08:45,104 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:08:45,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:08:45,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-09 05:08:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113860211] [2024-11-09 05:08:45,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:08:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:08:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:08:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:08:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2213, Unknown=93, NotChecked=98, Total=2652 [2024-11-09 05:08:45,108 INFO L87 Difference]: Start difference. First operand 643 states and 676 transitions. Second operand has 14 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:08:47,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:08:49,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:08:51,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:08:56,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:08:58,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:00,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:02,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:04,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:06,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:08,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:10,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:12,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:14,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:15,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:09:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:09:19,835 INFO L93 Difference]: Finished difference Result 642 states and 675 transitions. [2024-11-09 05:09:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:09:19,836 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-11-09 05:09:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:09:19,838 INFO L225 Difference]: With dead ends: 642 [2024-11-09 05:09:19,839 INFO L226 Difference]: Without dead ends: 642 [2024-11-09 05:09:19,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 200.8s TimeCoverageRelationStatistics Valid=308, Invalid=2909, Unknown=93, NotChecked=112, Total=3422 [2024-11-09 05:09:19,841 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 492 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 13 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:09:19,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2266 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2760 Invalid, 13 Unknown, 0 Unchecked, 34.0s Time] [2024-11-09 05:09:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-09 05:09:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-09 05:09:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 410 states have (on average 1.6243902439024391) internal successors, (666), 636 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:09:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 675 transitions. [2024-11-09 05:09:19,856 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 675 transitions. Word has length 65 [2024-11-09 05:09:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:09:19,857 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 675 transitions. [2024-11-09 05:09:19,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:09:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 675 transitions. [2024-11-09 05:09:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 05:09:19,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:09:19,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:09:19,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:09:20,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 05:09:20,064 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:09:20,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:09:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1646320684, now seen corresponding path program 1 times [2024-11-09 05:09:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:09:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981572415] [2024-11-09 05:09:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:09:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:09:21,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:09:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981572415] [2024-11-09 05:09:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981572415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474574724] [2024-11-09 05:09:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:21,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:09:21,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:09:21,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:09:21,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:09:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:21,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:09:21,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:09:21,774 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 6 treesize of output 5 [2024-11-09 05:09:22,122 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:09:22,123 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 11 treesize of output 11 [2024-11-09 05:09:22,218 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 1 [2024-11-09 05:09:22,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:09:22,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:09:22,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-09 05:09:22,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-09 05:09:22,977 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 39 treesize of output 21 [2024-11-09 05:09:22,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 05:09:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:09:23,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:09:23,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:09:23,455 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 48 treesize of output 52 [2024-11-09 05:09:23,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_805 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 25 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (forall ((v_ArrVal_806 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem54#1.base|)) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:09:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474574724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:23,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969695368] [2024-11-09 05:09:23,577 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-09 05:09:23,578 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:09:23,578 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:09:23,578 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:09:23,579 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:09:30,247 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 05:09:30,881 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:12:55,114 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '34933#(and (<= 1 |#StackHeapBarrier|) (or (< (+ 16 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_30| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_30| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#length_618| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_636| (Array Int Int))) (and (= (select |v_#valid_636| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#length| (store |v_#length_618| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_618| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (select |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)))) (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_#memory_int_439| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_442| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_441|) (= |v_#memory_int_439| (store |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_442|)))) (and (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_#memory_int_439| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_#memory_int_442| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_441|) (= (store |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_5|) (= |v_#memory_int_439| (store |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_442|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_618| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_636| (Array Int Int))) (and (= (select |v_#valid_636| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (select |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_618| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= |#length| (store |v_#length_618| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (store |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr226_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr226_30|))))) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-09 05:12:55,115 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:12:55,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:12:55,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-09 05:12:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582283065] [2024-11-09 05:12:55,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:12:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:12:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:12:55,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2908, Unknown=118, NotChecked=112, Total=3422 [2024-11-09 05:12:55,118 INFO L87 Difference]: Start difference. First operand 642 states and 675 transitions. Second operand has 19 states, 16 states have (on average 6.875) internal successors, (110), 19 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:12:57,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:12:59,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:01,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:03,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:05,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:07,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:09,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:11,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:13,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:15,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:17,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:19,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:21,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:23,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:25,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:27,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:29,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:35,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:36,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:43,446 INFO L93 Difference]: Finished difference Result 641 states and 674 transitions. [2024-11-09 05:13:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:13:43,447 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 19 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-09 05:13:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:43,449 INFO L225 Difference]: With dead ends: 641 [2024-11-09 05:13:43,449 INFO L226 Difference]: Without dead ends: 641 [2024-11-09 05:13:43,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 205.9s TimeCoverageRelationStatistics Valid=325, Invalid=3342, Unknown=119, NotChecked=120, Total=3906 [2024-11-09 05:13:43,451 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 490 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 3757 mSolverCounterSat, 19 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3757 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:43,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2340 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3757 Invalid, 18 Unknown, 0 Unchecked, 47.7s Time] [2024-11-09 05:13:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-09 05:13:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 636. [2024-11-09 05:13:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 406 states have (on average 1.625615763546798) internal successors, (660), 631 states have internal predecessors, (660), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:13:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 666 transitions. [2024-11-09 05:13:43,464 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 666 transitions. Word has length 65 [2024-11-09 05:13:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 666 transitions. [2024-11-09 05:13:43,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 19 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:13:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 666 transitions. [2024-11-09 05:13:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 05:13:43,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:43,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:13:43,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:13:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2ef2f8c-d387-4531-8ffe-4c116668b9d6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 05:13:43,666 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:13:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1607934952, now seen corresponding path program 1 times [2024-11-09 05:13:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901603665] [2024-11-09 05:13:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:13:44,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901603665] [2024-11-09 05:13:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901603665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:44,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:13:44,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:13:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061513741] [2024-11-09 05:13:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:44,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:13:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:13:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:13:44,751 INFO L87 Difference]: Start difference. First operand 636 states and 666 transitions. Second operand has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:13:49,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:51,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:53,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:55,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:57,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:13:59,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:01,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:03,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:05,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:07,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:09,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:10,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:15,013 INFO L93 Difference]: Finished difference Result 644 states and 677 transitions. [2024-11-09 05:14:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:14:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2024-11-09 05:14:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:15,015 INFO L225 Difference]: With dead ends: 644 [2024-11-09 05:14:15,016 INFO L226 Difference]: Without dead ends: 644 [2024-11-09 05:14:15,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:14:15,016 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 504 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 13 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:15,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2011 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2467 Invalid, 11 Unknown, 0 Unchecked, 29.9s Time] [2024-11-09 05:14:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-09 05:14:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 643. [2024-11-09 05:14:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 412 states have (on average 1.6213592233009708) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:14:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 677 transitions. [2024-11-09 05:14:15,031 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 677 transitions. Word has length 66 [2024-11-09 05:14:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:15,032 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 677 transitions. [2024-11-09 05:14:15,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:14:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 677 transitions. [2024-11-09 05:14:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 05:14:15,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:15,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:15,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 05:14:15,033 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:14:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1607934951, now seen corresponding path program 1 times [2024-11-09 05:14:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:15,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466414332] [2024-11-09 05:14:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:14:16,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466414332] [2024-11-09 05:14:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466414332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:14:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:14:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145388172] [2024-11-09 05:14:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:16,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:14:16,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:14:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:14:16,538 INFO L87 Difference]: Start difference. First operand 643 states and 677 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:14:18,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:20,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:22,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:24,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:26,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:28,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:30,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:32,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:34,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:14:39,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []