./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-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_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/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_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/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_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/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 a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:03:07,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:03:07,663 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:03:07,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:03:07,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:03:07,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:03:07,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:03:07,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:03:07,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:03:07,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:03:07,692 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:03:07,693 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:03:07,693 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:03:07,694 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:03:07,694 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:03:07,695 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:03:07,695 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:03:07,696 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:03:07,696 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:03:07,697 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:03:07,698 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:03:07,700 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:03:07,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:03:07,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:03:07,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:03:07,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:03:07,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:03:07,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:03:07,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:03:07,703 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:03:07,703 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:03:07,704 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:03:07,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:03:07,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:03:07,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:03:07,705 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:03:07,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:03:07,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:03:07,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:03:07,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:03:07,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:03:07,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:03:07,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:03:07,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:03:07,708 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:03:07,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:03:07,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:03:07,709 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:03:07,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:03:07,709 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_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/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_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/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 -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2024-11-09 06:03:08,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:03:08,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:03:08,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:03:08,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:03:08,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:03:08,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i Unable to find full path for "g++" [2024-11-09 06:03:10,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:03:10,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:03:10,392 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-11-09 06:03:10,409 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/data/44971bd6e/6a30f144e6f946f5992685ad1f7242d2/FLAG6f4ed078f [2024-11-09 06:03:10,426 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/data/44971bd6e/6a30f144e6f946f5992685ad1f7242d2 [2024-11-09 06:03:10,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:03:10,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:03:10,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:03:10,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:03:10,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:03:10,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:03:10" (1/1) ... [2024-11-09 06:03:10,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f0ea01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:10, skipping insertion in model container [2024-11-09 06:03:10,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:03:10" (1/1) ... [2024-11-09 06:03:10,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:03:11,031 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 06:03:11,087 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 06:03:11,093 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 06:03:11,101 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 06:03:11,113 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 06:03:11,142 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 06:03:11,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:03:11,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:03:11,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:03:11,346 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:03:11,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11 WrapperNode [2024-11-09 06:03:11,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:03:11,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:03:11,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:03:11,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:03:11,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,430 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-09 06:03:11,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:03:11,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:03:11,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:03:11,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:03:11,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:03:11,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:03:11,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:03:11,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:03:11,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (1/1) ... [2024-11-09 06:03:11,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:03:11,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:11,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:03:11,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:03:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:03:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:03:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:03:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:03:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 06:03:11,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 06:03:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:03:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:03:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:03:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:03:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:03:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:03:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:03:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:03:11,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:03:11,880 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:03:11,885 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 06:03:14,043 INFO L? ?]: Removed 777 outVars from TransFormulas that were not future-live. [2024-11-09 06:03:14,044 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:03:14,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:03:14,957 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-09 06:03:14,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:03:14 BoogieIcfgContainer [2024-11-09 06:03:14,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:03:14,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:03:14,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:03:14,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:03:14,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:03:10" (1/3) ... [2024-11-09 06:03:14,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5758b298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:03:14, skipping insertion in model container [2024-11-09 06:03:14,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:03:11" (2/3) ... [2024-11-09 06:03:14,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5758b298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:03:14, skipping insertion in model container [2024-11-09 06:03:14,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:03:14" (3/3) ... [2024-11-09 06:03:14,973 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2024-11-09 06:03:14,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:03:14,994 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-09 06:03:15,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:03:15,085 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;@37ba0548, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:03:15,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-09 06:03:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 596 states, 263 states have (on average 2.4790874524714828) internal successors, (652), 590 states have internal predecessors, (652), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:03:15,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:15,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:03:15,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:15,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:15,112 INFO L85 PathProgramCache]: Analyzing trace with hash 44121243, now seen corresponding path program 1 times [2024-11-09 06:03:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:15,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819421575] [2024-11-09 06:03:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:15,391 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 06:03:15,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819421575] [2024-11-09 06:03:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819421575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:03:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90542844] [2024-11-09 06:03:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:15,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:03:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:15,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:03:15,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:15,447 INFO L87 Difference]: Start difference. First operand has 596 states, 263 states have (on average 2.4790874524714828) internal successors, (652), 590 states have internal predecessors, (652), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 06:03:17,655 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 06:03:19,696 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 06:03:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:20,280 INFO L93 Difference]: Finished difference Result 540 states and 592 transitions. [2024-11-09 06:03:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:03:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 06:03:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:20,296 INFO L225 Difference]: With dead ends: 540 [2024-11-09 06:03:20,296 INFO L226 Difference]: Without dead ends: 539 [2024-11-09 06:03:20,297 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 06:03:20,303 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 482 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:20,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 286 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 394 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 06:03:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-09 06:03:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2024-11-09 06:03:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 258 states have (on average 2.1705426356589146) internal successors, (560), 530 states have internal predecessors, (560), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 586 transitions. [2024-11-09 06:03:20,380 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 586 transitions. Word has length 4 [2024-11-09 06:03:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:20,380 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 586 transitions. [2024-11-09 06:03:20,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 06:03:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 586 transitions. [2024-11-09 06:03:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:03:20,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:20,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:03:20,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:03:20,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:20,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 44121244, now seen corresponding path program 1 times [2024-11-09 06:03:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687876698] [2024-11-09 06:03:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:20,546 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 06:03:20,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:20,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687876698] [2024-11-09 06:03:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687876698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:03:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861937658] [2024-11-09 06:03:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:20,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:03:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:03:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:20,550 INFO L87 Difference]: Start difference. First operand 536 states and 586 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 06:03:22,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 06:03:24,687 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 06:03:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:25,171 INFO L93 Difference]: Finished difference Result 522 states and 574 transitions. [2024-11-09 06:03:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:03:25,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 06:03:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:25,175 INFO L225 Difference]: With dead ends: 522 [2024-11-09 06:03:25,175 INFO L226 Difference]: Without dead ends: 522 [2024-11-09 06:03:25,175 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 06:03:25,177 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 282 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:25,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 520 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 330 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 06:03:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-09 06:03:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 511. [2024-11-09 06:03:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 258 states have (on average 2.0736434108527133) internal successors, (535), 505 states have internal predecessors, (535), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 561 transitions. [2024-11-09 06:03:25,199 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 561 transitions. Word has length 4 [2024-11-09 06:03:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:25,200 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 561 transitions. [2024-11-09 06:03:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 06:03:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 561 transitions. [2024-11-09 06:03:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 06:03:25,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:25,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 06:03:25,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:03:25,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash 587696931, now seen corresponding path program 1 times [2024-11-09 06:03:25,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:25,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555712872] [2024-11-09 06:03:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:25,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:25,234 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 06:03:25,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555712872] [2024-11-09 06:03:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555712872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:25,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:03:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105765723] [2024-11-09 06:03:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:25,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:03:25,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:03:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:25,237 INFO L87 Difference]: Start difference. First operand 511 states and 561 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 06:03:27,274 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 06:03:29,303 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 06:03:31,410 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 06:03:32,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:03:34,795 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 06:03:36,798 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 06:03:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:36,940 INFO L93 Difference]: Finished difference Result 977 states and 1055 transitions. [2024-11-09 06:03:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:03:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 06:03:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:36,948 INFO L225 Difference]: With dead ends: 977 [2024-11-09 06:03:36,949 INFO L226 Difference]: Without dead ends: 977 [2024-11-09 06:03:36,949 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 06:03:36,951 INFO L432 NwaCegarLoop]: 664 mSDtfsCounter, 487 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:36,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1151 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 11.7s Time] [2024-11-09 06:03:36,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-09 06:03:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 513. [2024-11-09 06:03:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 260 states have (on average 2.0653846153846156) internal successors, (537), 507 states have internal predecessors, (537), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 563 transitions. [2024-11-09 06:03:36,983 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 563 transitions. Word has length 6 [2024-11-09 06:03:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:36,984 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 563 transitions. [2024-11-09 06:03:36,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 06:03:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 563 transitions. [2024-11-09 06:03:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:03:36,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:36,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:36,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:03:36,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1393977042, now seen corresponding path program 1 times [2024-11-09 06:03:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:36,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609616586] [2024-11-09 06:03:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:37,074 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 06:03:37,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609616586] [2024-11-09 06:03:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609616586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:03:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747718980] [2024-11-09 06:03:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:37,077 INFO L87 Difference]: Start difference. First operand 513 states and 563 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 06:03:39,185 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 06:03:41,225 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 06:03:43,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:03:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:43,675 INFO L93 Difference]: Finished difference Result 494 states and 544 transitions. [2024-11-09 06:03:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-09 06:03:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:43,678 INFO L225 Difference]: With dead ends: 494 [2024-11-09 06:03:43,678 INFO L226 Difference]: Without dead ends: 494 [2024-11-09 06:03:43,678 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 06:03:43,682 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 521 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:43,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 435 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 642 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2024-11-09 06:03:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-09 06:03:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2024-11-09 06:03:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 260 states have (on average 1.976923076923077) internal successors, (514), 484 states have internal predecessors, (514), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 540 transitions. [2024-11-09 06:03:43,729 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 540 transitions. Word has length 11 [2024-11-09 06:03:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:43,729 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 540 transitions. [2024-11-09 06:03:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 06:03:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 540 transitions. [2024-11-09 06:03:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:03:43,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:43,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:43,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:03:43,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1393977041, now seen corresponding path program 1 times [2024-11-09 06:03:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:43,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79364953] [2024-11-09 06:03:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:43,844 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 06:03:43,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79364953] [2024-11-09 06:03:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79364953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:03:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055561249] [2024-11-09 06:03:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:03:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:43,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:03:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:43,847 INFO L87 Difference]: Start difference. First operand 490 states and 540 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 06:03:45,903 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 06:03:47,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:03:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:47,771 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2024-11-09 06:03:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:03:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-09 06:03:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:47,774 INFO L225 Difference]: With dead ends: 462 [2024-11-09 06:03:47,774 INFO L226 Difference]: Without dead ends: 462 [2024-11-09 06:03:47,775 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 06:03:47,776 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 51 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:47,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 832 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 06:03:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-09 06:03:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2024-11-09 06:03:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 244 states have (on average 1.9836065573770492) internal successors, (484), 456 states have internal predecessors, (484), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 510 transitions. [2024-11-09 06:03:47,792 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 510 transitions. Word has length 11 [2024-11-09 06:03:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:47,793 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 510 transitions. [2024-11-09 06:03:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 06:03:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 510 transitions. [2024-11-09 06:03:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:03:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:47,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:03:47,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:47,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash -256845752, now seen corresponding path program 1 times [2024-11-09 06:03:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241062815] [2024-11-09 06:03:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:47,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:47,904 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 06:03:47,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241062815] [2024-11-09 06:03:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241062815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:03:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612469647] [2024-11-09 06:03:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:47,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:47,908 INFO L87 Difference]: Start difference. First operand 462 states and 510 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:03:49,983 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 06:03:51,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:03:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:51,242 INFO L93 Difference]: Finished difference Result 451 states and 492 transitions. [2024-11-09 06:03:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-09 06:03:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:51,245 INFO L225 Difference]: With dead ends: 451 [2024-11-09 06:03:51,245 INFO L226 Difference]: Without dead ends: 451 [2024-11-09 06:03:51,246 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 06:03:51,246 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 38 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:51,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1213 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:03:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-09 06:03:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2024-11-09 06:03:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 237 states have (on average 1.9535864978902953) internal successors, (463), 442 states have internal predecessors, (463), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 489 transitions. [2024-11-09 06:03:51,259 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 489 transitions. Word has length 12 [2024-11-09 06:03:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:51,259 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 489 transitions. [2024-11-09 06:03:51,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:03:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 489 transitions. [2024-11-09 06:03:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:03:51,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:51,260 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] [2024-11-09 06:03:51,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:03:51,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 668755798, now seen corresponding path program 1 times [2024-11-09 06:03:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595635520] [2024-11-09 06:03:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:51,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:51,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 06:03:51,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595635520] [2024-11-09 06:03:51,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595635520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:51,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:51,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:03:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843982945] [2024-11-09 06:03:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:51,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:51,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:51,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:51,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:51,496 INFO L87 Difference]: Start difference. First operand 448 states and 489 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 06:03:53,547 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 06:03:55,553 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 06:03:57,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:03:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:57,928 INFO L93 Difference]: Finished difference Result 459 states and 502 transitions. [2024-11-09 06:03:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:57,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-09 06:03:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:57,931 INFO L225 Difference]: With dead ends: 459 [2024-11-09 06:03:57,931 INFO L226 Difference]: Without dead ends: 459 [2024-11-09 06:03:57,932 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 06:03:57,933 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 220 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:57,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 685 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2024-11-09 06:03:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-09 06:03:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 444. [2024-11-09 06:03:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 237 states have (on average 1.9367088607594938) internal successors, (459), 438 states have internal predecessors, (459), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:03:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 485 transitions. [2024-11-09 06:03:57,945 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 485 transitions. Word has length 26 [2024-11-09 06:03:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:57,962 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 485 transitions. [2024-11-09 06:03:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 06:03:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 485 transitions. [2024-11-09 06:03:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 06:03:57,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:57,964 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] [2024-11-09 06:03:57,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:03:57,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:03:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2062650481, now seen corresponding path program 1 times [2024-11-09 06:03:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859658536] [2024-11-09 06:03:57,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:58,153 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 06:03:58,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859658536] [2024-11-09 06:03:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859658536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:58,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:03:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442990507] [2024-11-09 06:03:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:58,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:58,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:58,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:58,156 INFO L87 Difference]: Start difference. First operand 444 states and 485 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 06:04:00,226 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 06:04:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:00,962 INFO L93 Difference]: Finished difference Result 444 states and 481 transitions. [2024-11-09 06:04:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:04:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-11-09 06:04:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:00,965 INFO L225 Difference]: With dead ends: 444 [2024-11-09 06:04:00,965 INFO L226 Difference]: Without dead ends: 444 [2024-11-09 06:04:00,966 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 06:04:00,966 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 15 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:00,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1201 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:04:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-09 06:04:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2024-11-09 06:04:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 237 states have (on average 1.919831223628692) internal successors, (455), 438 states have internal predecessors, (455), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:04:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 481 transitions. [2024-11-09 06:04:00,978 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 481 transitions. Word has length 42 [2024-11-09 06:04:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:00,978 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 481 transitions. [2024-11-09 06:04:00,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 06:04:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 481 transitions. [2024-11-09 06:04:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 06:04:00,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:00,980 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] [2024-11-09 06:04:00,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:04:00,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:04:00,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash -454671997, now seen corresponding path program 1 times [2024-11-09 06:04:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:00,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807641183] [2024-11-09 06:04:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:01,147 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 06:04:01,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807641183] [2024-11-09 06:04:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807641183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:04:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:04:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:04:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101050945] [2024-11-09 06:04:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:04:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:04:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:04:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:04:01,149 INFO L87 Difference]: Start difference. First operand 444 states and 481 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 06:04:03,170 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 06:04:05,266 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 06:04:07,272 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 06:04:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:07,364 INFO L93 Difference]: Finished difference Result 486 states and 523 transitions. [2024-11-09 06:04:07,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:04:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-11-09 06:04:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:07,367 INFO L225 Difference]: With dead ends: 486 [2024-11-09 06:04:07,367 INFO L226 Difference]: Without dead ends: 486 [2024-11-09 06:04:07,367 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 06:04:07,368 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:07,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 815 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 06:04:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-09 06:04:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-11-09 06:04:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 279 states have (on average 1.7813620071684588) internal successors, (497), 480 states have internal predecessors, (497), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:04:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 523 transitions. [2024-11-09 06:04:07,380 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 523 transitions. Word has length 46 [2024-11-09 06:04:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:07,380 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 523 transitions. [2024-11-09 06:04:07,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 06:04:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 523 transitions. [2024-11-09 06:04:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:04:07,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:07,382 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 06:04:07,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:04:07,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:04:07,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 101639965, now seen corresponding path program 1 times [2024-11-09 06:04:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743217844] [2024-11-09 06:04:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:07,881 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 06:04:07,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743217844] [2024-11-09 06:04:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743217844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:04:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:04:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:04:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718242629] [2024-11-09 06:04:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:04:07,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:04:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:04:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:04:07,884 INFO L87 Difference]: Start difference. First operand 486 states and 523 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 06:04:09,928 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 06:04:11,931 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 06:04:13,934 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 06:04:15,937 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 06:04:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:16,619 INFO L93 Difference]: Finished difference Result 485 states and 522 transitions. [2024-11-09 06:04:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:04:16,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 06:04:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:16,621 INFO L225 Difference]: With dead ends: 485 [2024-11-09 06:04:16,621 INFO L226 Difference]: Without dead ends: 485 [2024-11-09 06:04:16,622 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 06:04:16,622 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 2 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:16,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1132 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2024-11-09 06:04:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-09 06:04:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2024-11-09 06:04:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 279 states have (on average 1.7777777777777777) internal successors, (496), 479 states have internal predecessors, (496), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:04:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 522 transitions. [2024-11-09 06:04:16,640 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 522 transitions. Word has length 53 [2024-11-09 06:04:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:16,640 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 522 transitions. [2024-11-09 06:04:16,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 06:04:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 522 transitions. [2024-11-09 06:04:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:04:16,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:16,642 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 06:04:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:04:16,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:04:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 101639966, now seen corresponding path program 1 times [2024-11-09 06:04:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849411546] [2024-11-09 06:04:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:17,404 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 06:04:17,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849411546] [2024-11-09 06:04:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849411546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:04:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:04:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:04:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785276467] [2024-11-09 06:04:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:04:17,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:04:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:04:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:04:17,408 INFO L87 Difference]: Start difference. First operand 485 states and 522 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 06:04:19,451 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 06:04:21,455 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 06:04:23,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:04:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:24,057 INFO L93 Difference]: Finished difference Result 484 states and 521 transitions. [2024-11-09 06:04:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:04:24,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 06:04:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:24,060 INFO L225 Difference]: With dead ends: 484 [2024-11-09 06:04:24,060 INFO L226 Difference]: Without dead ends: 484 [2024-11-09 06:04:24,060 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 06:04:24,061 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:24,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1093 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 806 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2024-11-09 06:04:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-09 06:04:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2024-11-09 06:04:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 278 states have (on average 1.7805755395683454) internal successors, (495), 478 states have internal predecessors, (495), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:04:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 521 transitions. [2024-11-09 06:04:24,073 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 521 transitions. Word has length 53 [2024-11-09 06:04:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 521 transitions. [2024-11-09 06:04:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 06:04:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 521 transitions. [2024-11-09 06:04:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:04:24,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:24,074 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] [2024-11-09 06:04:24,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:04:24,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:04:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 102013507, now seen corresponding path program 1 times [2024-11-09 06:04:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957034626] [2024-11-09 06:04:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:24,449 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 06:04:24,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957034626] [2024-11-09 06:04:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957034626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:04:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:04:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:04:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410147178] [2024-11-09 06:04:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:04:24,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:04:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:04:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:04:24,453 INFO L87 Difference]: Start difference. First operand 484 states and 521 transitions. Second operand has 7 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 06:04:26,503 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 06:04:28,507 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 06:04:30,510 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 06:04:32,512 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 06:04:34,517 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 06:04:36,520 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 06:04:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:37,442 INFO L93 Difference]: Finished difference Result 494 states and 534 transitions. [2024-11-09 06:04:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:04:37,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 59 [2024-11-09 06:04:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:37,445 INFO L225 Difference]: With dead ends: 494 [2024-11-09 06:04:37,445 INFO L226 Difference]: Without dead ends: 494 [2024-11-09 06:04:37,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:04:37,446 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 11 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 14 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:37,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1666 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1168 Invalid, 6 Unknown, 0 Unchecked, 12.9s Time] [2024-11-09 06:04:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-09 06:04:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 489. [2024-11-09 06:04:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 282 states have (on average 1.7765957446808511) internal successors, (501), 482 states have internal predecessors, (501), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 06:04:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 530 transitions. [2024-11-09 06:04:37,458 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 530 transitions. Word has length 59 [2024-11-09 06:04:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:37,458 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 530 transitions. [2024-11-09 06:04:37,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 06:04:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 530 transitions. [2024-11-09 06:04:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:04:37,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:37,463 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] [2024-11-09 06:04:37,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:04:37,463 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:04:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 102013508, now seen corresponding path program 1 times [2024-11-09 06:04:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923184806] [2024-11-09 06:04:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:38,249 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 06:04:38,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923184806] [2024-11-09 06:04:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923184806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:04:38,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:04:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:04:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105898708] [2024-11-09 06:04:38,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:04:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:04:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:04:38,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:04:38,252 INFO L87 Difference]: Start difference. First operand 489 states and 530 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 06:04:40,302 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 06:04:42,312 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 06:04:44,325 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 06:04:46,328 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 06:04:48,332 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 06:04:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:49,182 INFO L93 Difference]: Finished difference Result 489 states and 529 transitions. [2024-11-09 06:04:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:04:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 59 [2024-11-09 06:04:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:49,185 INFO L225 Difference]: With dead ends: 489 [2024-11-09 06:04:49,185 INFO L226 Difference]: Without dead ends: 489 [2024-11-09 06:04:49,185 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 06:04:49,186 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 7 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:49,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1353 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1002 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2024-11-09 06:04:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-09 06:04:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2024-11-09 06:04:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 282 states have (on average 1.7730496453900708) internal successors, (500), 482 states have internal predecessors, (500), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 06:04:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 529 transitions. [2024-11-09 06:04:49,198 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 529 transitions. Word has length 59 [2024-11-09 06:04:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:49,199 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 529 transitions. [2024-11-09 06:04:49,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 06:04:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 529 transitions. [2024-11-09 06:04:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 06:04:49,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:49,200 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] [2024-11-09 06:04:49,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:04:49,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:04:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2111670610, now seen corresponding path program 1 times [2024-11-09 06:04:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368142848] [2024-11-09 06:04:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:49,952 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 06:04:49,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:49,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368142848] [2024-11-09 06:04:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368142848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107004444] [2024-11-09 06:04:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:04:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:04:49,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:04:49,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:04:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:50,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:04:50,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:04:50,370 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:04:50,371 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 06:04:50,394 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 06:04:50,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:04:50,472 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 06:04:50,509 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 06:04:50,513 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 06:04:50,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:04:50,583 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 06:04:50,583 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 06:04:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107004444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1406257433] [2024-11-09 06:04:50,652 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2024-11-09 06:04:50,652 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:04:50,656 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:04:50,662 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:04:50,662 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:04:56,134 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 06:04:56,428 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:28,838 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13943#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#t~mem52#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (or (and (exists ((|v_#valid_476| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_278| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_276| (Array Int (Array Int Int))) (|v_#length_462| (Array Int Int)) (|v_#memory_$Pointer$.base_275| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_276| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_276| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_278| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_278|) (= |#valid| (store |v_#valid_476| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_275| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_275| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_276| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_276|) (<= 40 (select |v_#length_462| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_278| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_278| |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)))) (= 0 (select |v_#valid_476| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8))) (= (select |v_#valid_476| |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_#length_462| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr160_18| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr160_18|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_18| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_271| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_272| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_274| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_274| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_274|) (= |v_#memory_$Pointer$.offset_272| (store |v_#memory_$Pointer$.offset_271| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_271| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_main_~user~0#1.base|) 36)))))) (exists ((|v_#memory_int_324| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_325| (Array Int (Array Int Int))) (|v_#memory_int_320| (Array Int (Array Int Int))) (|v_#memory_int_322| (Array Int (Array Int Int)))) (and (= |v_#memory_int_322| (store |v_#memory_int_320| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_320| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_322| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_324| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_324| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_325| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_325|) (= (store |v_#memory_int_325| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_325| |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))) |v_old(#memory_int)_AFTER_CALL_2|) (= (store |v_#memory_int_322| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_322| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_324| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_324|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_18| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr160_18|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_18| 4294967296)))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#valid_476| (Array Int Int)) (|v_#memory_$Pointer$.base_278| (Array Int (Array Int Int))) (|v_#length_462| (Array Int Int)) (|v_#memory_$Pointer$.base_276| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_275| (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_#memory_$Pointer$.base_276| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_276| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_278| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_278|) (= |#length| (store |v_#length_462| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (store |v_#memory_$Pointer$.base_275| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_275| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_276| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_276|) (<= 40 (select |v_#length_462| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_476| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_278| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_278| |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)))) (= (select |v_#valid_476| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#valid_476| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_271| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_272| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_274| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_274| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_274|) (= |v_#memory_$Pointer$.offset_272| (store |v_#memory_$Pointer$.offset_271| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_271| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_main_~user~0#1.base|) 36)))))) (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_324| (Array Int (Array Int Int))) (|v_#memory_int_325| (Array Int (Array Int Int))) (|v_#memory_int_320| (Array Int (Array Int Int))) (|v_#memory_int_322| (Array Int (Array Int Int)))) (and (= |v_#memory_int_322| (store |v_#memory_int_320| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_320| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_322| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_324| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_324| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_325| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_325|) (= (store |v_#memory_int_322| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_322| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_324| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_324|) (= |v_old(#memory_int)_AFTER_CALL_3| (store |v_#memory_int_325| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_325| |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)))))))) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= ~count_int_int~0 0))' at error location [2024-11-09 06:07:28,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:28,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:07:28,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-09 06:07:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276494630] [2024-11-09 06:07:28,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:28,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:07:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:28,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:07:28,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1758, Unknown=92, NotChecked=0, Total=2070 [2024-11-09 06:07:28,842 INFO L87 Difference]: Start difference. First operand 489 states and 529 transitions. Second operand has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 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 06:07:31,113 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 06:07:33,116 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 06:07:35,119 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 06:07:37,122 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 06:07:39,128 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 06:07:41,133 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 06:07:43,139 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 06:07:45,142 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 06:07:47,150 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 06:07:49,155 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 06:07:51,159 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 06:07:53,163 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 06:08:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:08:00,803 INFO L93 Difference]: Finished difference Result 488 states and 528 transitions. [2024-11-09 06:08:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:08:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 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 60 [2024-11-09 06:08:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:08:00,806 INFO L225 Difference]: With dead ends: 488 [2024-11-09 06:08:00,806 INFO L226 Difference]: Without dead ends: 488 [2024-11-09 06:08:00,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 153.2s TimeCoverageRelationStatistics Valid=282, Invalid=2373, Unknown=101, NotChecked=0, Total=2756 [2024-11-09 06:08:00,808 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 406 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 25 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:08:00,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1758 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2537 Invalid, 12 Unknown, 0 Unchecked, 31.2s Time] [2024-11-09 06:08:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-09 06:08:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2024-11-09 06:08:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 282 states have (on average 1.7695035460992907) internal successors, (499), 481 states have internal predecessors, (499), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 06:08:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 528 transitions. [2024-11-09 06:08:00,823 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 528 transitions. Word has length 60 [2024-11-09 06:08:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:08:00,823 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 528 transitions. [2024-11-09 06:08:00,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 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 06:08:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 528 transitions. [2024-11-09 06:08:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 06:08:00,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:08:00,824 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] [2024-11-09 06:08:00,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:08:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:08:01,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:08:01,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:08:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2111670609, now seen corresponding path program 1 times [2024-11-09 06:08:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:08:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106126556] [2024-11-09 06:08:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:08:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:08:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:08:02,738 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 06:08:02,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:08:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106126556] [2024-11-09 06:08:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106126556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:08:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96369431] [2024-11-09 06:08:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:08:02,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:08:02,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:08:02,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:08:02,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:08:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:08:02,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 06:08:02,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:08:03,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:08:03,316 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 06:08:03,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:08:03,418 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 06:08:03,432 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 13 treesize of output 9 [2024-11-09 06:08:03,688 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 22 treesize of output 10 [2024-11-09 06:08:03,702 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 9 treesize of output 3 [2024-11-09 06:08:04,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:08:04,065 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 62 treesize of output 57 [2024-11-09 06:08:04,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:08:04,203 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 06:08:04,221 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 9 treesize of output 3 [2024-11-09 06:08:04,300 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 06:08:04,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:08:04,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_583 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:08:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96369431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:08:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420926251] [2024-11-09 06:08:04,676 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2024-11-09 06:08:04,676 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:08:04,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:08:04,677 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:08:04,677 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:08:10,881 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 130 for LOIs [2024-11-09 06:08:11,830 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:10:58,969 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15174#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#length_465| (Array Int Int)) (|v_#valid_479| (Array Int Int)) (|v_#memory_$Pointer$.base_300| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_298| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_297| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_298| (store |v_#memory_$Pointer$.base_297| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_297| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_298| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (store |v_#memory_$Pointer$.base_298| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_298| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_300|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_479| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#valid_479| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_479| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (store |v_#length_465| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_300| |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)))) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_465| |ULTIMATE.start_main_~user~0#1.base|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr160_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_30|))) (exists ((|v_#memory_$Pointer$.offset_293| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_294| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_294| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_294| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_296|) (= (store |v_#memory_$Pointer$.offset_293| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_293| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_294| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_294|))) (exists ((|v_#memory_int_338| (Array Int (Array Int Int))) (|v_#memory_int_342| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_343| (Array Int (Array Int Int))) (|v_#memory_int_340| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_338| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_338| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_340| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_340|) (= (store |v_#memory_int_343| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_343| |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))) |v_old(#memory_int)_AFTER_CALL_6|) (= |v_#memory_int_342| (store |v_#memory_int_340| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_340| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_342| |ULTIMATE.start_main_~user~0#1.base|) 16)))) (= (store |v_#memory_int_342| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_342| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_343| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_343|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_30|))) (exists ((|v_#memory_int_338| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_342| (Array Int (Array Int Int))) (|v_#memory_int_343| (Array Int (Array Int Int))) (|v_#memory_int_340| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_338| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_338| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_340| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_340|) (= (store |v_#memory_int_343| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_343| |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_342| (store |v_#memory_int_340| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_340| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_342| |ULTIMATE.start_main_~user~0#1.base|) 16)))) (= (store |v_#memory_int_342| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_342| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_343| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_343|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_465| (Array Int Int)) (|v_#valid_479| (Array Int Int)) (|v_#memory_$Pointer$.base_300| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_298| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_297| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_298| (store |v_#memory_$Pointer$.base_297| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_297| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_298| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (store |v_#memory_$Pointer$.base_298| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_298| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_300|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (select |v_#valid_479| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_300| |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)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |#length| (store |v_#length_465| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= |#valid| (store |v_#valid_479| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1)) (= (select |v_#valid_479| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (<= 40 (select |v_#length_465| |ULTIMATE.start_main_~user~0#1.base|)))) (exists ((|v_#memory_$Pointer$.offset_293| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_294| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_294| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_294| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_296|) (= (store |v_#memory_$Pointer$.offset_293| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_293| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_294| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_294|))))) (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))) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= ~count_int_int~0 0))' at error location [2024-11-09 06:10:58,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:10:58,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:10:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-09 06:10:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390192079] [2024-11-09 06:10:58,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:10:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:10:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:10:58,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:10:58,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2215, Unknown=91, NotChecked=98, Total=2652 [2024-11-09 06:10:58,975 INFO L87 Difference]: Start difference. First operand 488 states and 528 transitions. Second operand has 18 states, 15 states have (on average 5.266666666666667) internal successors, (79), 18 states have internal predecessors, (79), 2 states have call successors, (2), 2 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 06:11:01,412 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 06:11:03,427 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 06:11:05,431 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 06:11:07,436 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 06:11:09,440 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 06:11:11,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:11:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:26,901 INFO L93 Difference]: Finished difference Result 492 states and 532 transitions. [2024-11-09 06:11:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:11:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.266666666666667) internal successors, (79), 18 states have internal predecessors, (79), 2 states have call successors, (2), 2 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 60 [2024-11-09 06:11:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:26,904 INFO L225 Difference]: With dead ends: 492 [2024-11-09 06:11:26,905 INFO L226 Difference]: Without dead ends: 492 [2024-11-09 06:11:26,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 168.9s TimeCoverageRelationStatistics Valid=286, Invalid=2597, Unknown=91, NotChecked=106, Total=3080 [2024-11-09 06:11:26,907 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 385 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 4588 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 4622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4588 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:26,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 2030 Invalid, 4622 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 4588 Invalid, 5 Unknown, 0 Unchecked, 27.2s Time] [2024-11-09 06:11:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-09 06:11:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485. [2024-11-09 06:11:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 280 states have (on average 1.7714285714285714) internal successors, (496), 478 states have internal predecessors, (496), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:11:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 522 transitions. [2024-11-09 06:11:26,920 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 522 transitions. Word has length 60 [2024-11-09 06:11:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:26,921 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 522 transitions. [2024-11-09 06:11:26,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.266666666666667) internal successors, (79), 18 states have internal predecessors, (79), 2 states have call successors, (2), 2 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 06:11:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 522 transitions. [2024-11-09 06:11:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:11:26,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:26,923 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] [2024-11-09 06:11:26,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:11:27,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:27,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:11:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -748500752, now seen corresponding path program 1 times [2024-11-09 06:11:27,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:27,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935751397] [2024-11-09 06:11:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:28,414 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 06:11:28,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935751397] [2024-11-09 06:11:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935751397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 06:11:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890329266] [2024-11-09 06:11:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:11:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:11:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:11:28,417 INFO L87 Difference]: Start difference. First operand 485 states and 522 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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 06:11:30,648 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 06:11:32,653 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 06:11:34,661 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 06:11:36,666 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 06:11:38,670 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 06:11:40,679 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 06:11:42,684 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 06:11:44,692 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 06:11:46,701 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 06:11:48,712 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 06:11:50,714 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 06:11:52,721 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 06:12:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:00,169 INFO L93 Difference]: Finished difference Result 495 states and 535 transitions. [2024-11-09 06:12:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:12:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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 61 [2024-11-09 06:12:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:00,172 INFO L225 Difference]: With dead ends: 495 [2024-11-09 06:12:00,172 INFO L226 Difference]: Without dead ends: 495 [2024-11-09 06:12:00,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:12:00,174 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 393 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 24 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:00,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1531 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2291 Invalid, 12 Unknown, 0 Unchecked, 31.3s Time] [2024-11-09 06:12:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-09 06:12:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2024-11-09 06:12:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 484 states have internal predecessors, (504), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 06:12:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 531 transitions. [2024-11-09 06:12:00,187 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 531 transitions. Word has length 61 [2024-11-09 06:12:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:00,187 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 531 transitions. [2024-11-09 06:12:00,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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 06:12:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 531 transitions. [2024-11-09 06:12:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:12:00,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:00,188 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] [2024-11-09 06:12:00,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:12:00,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:12:00,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash -748500751, now seen corresponding path program 1 times [2024-11-09 06:12:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:00,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34717187] [2024-11-09 06:12:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:01,820 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 06:12:01,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34717187] [2024-11-09 06:12:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34717187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:12:01,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:12:01,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:12:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125915326] [2024-11-09 06:12:01,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:12:01,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:12:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:12:01,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:12:01,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:12:01,824 INFO L87 Difference]: Start difference. First operand 492 states and 531 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 06:12:04,152 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 06:12:06,155 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 06:12:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:16,622 INFO L93 Difference]: Finished difference Result 494 states and 534 transitions. [2024-11-09 06:12:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:12:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 61 [2024-11-09 06:12:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:16,625 INFO L225 Difference]: With dead ends: 494 [2024-11-09 06:12:16,625 INFO L226 Difference]: Without dead ends: 494 [2024-11-09 06:12:16,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:12:16,626 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 387 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:16,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1248 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2548 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2024-11-09 06:12:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-09 06:12:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2024-11-09 06:12:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 286 states have (on average 1.7587412587412588) internal successors, (503), 484 states have internal predecessors, (503), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 06:12:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 530 transitions. [2024-11-09 06:12:16,640 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 530 transitions. Word has length 61 [2024-11-09 06:12:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:16,641 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 530 transitions. [2024-11-09 06:12:16,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 06:12:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 530 transitions. [2024-11-09 06:12:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 06:12:16,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:16,642 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] [2024-11-09 06:12:16,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:12:16,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 06:12:16,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2090125669, now seen corresponding path program 1 times [2024-11-09 06:12:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:12:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780819159] [2024-11-09 06:12:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:12:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:18,057 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 06:12:18,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780819159] [2024-11-09 06:12:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780819159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862201143] [2024-11-09 06:12:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:12:18,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:18,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdb6d875-baf3-454c-9eaa-b4a32c7f7acc/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:12:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:18,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:12:18,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:18,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:12:18,656 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 06:12:18,681 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 06:12:18,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:12:18,859 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 06:12:19,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:12:19,047 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 06:12:19,071 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 06:12:19,082 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 06:12:19,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:19,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 06:12:19,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 06:12:19,326 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-09 06:12:19,326 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 33 treesize of output 32 [2024-11-09 06:12:19,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_834 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_834))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 06:12:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862201143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:19,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744448175] [2024-11-09 06:12:19,355 INFO L159 IcfgInterpreter]: Started Sifa with 62 locations of interest [2024-11-09 06:12:19,355 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:12:19,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:12:19,356 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:12:19,357 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:12:25,481 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 06:12:25,977 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:15:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1744448175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:15:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:15:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [14, 12] total 47 [2024-11-09 06:15:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695995282] [2024-11-09 06:15:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:15:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 06:15:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:15:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 06:15:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1922, Unknown=108, NotChecked=282, Total=2550 [2024-11-09 06:15:12,765 INFO L87 Difference]: Start difference. First operand 492 states and 530 transitions. Second operand has 34 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 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 06:15:15,056 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 [0] [2024-11-09 06:15:17,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=true, quantifiers [0] [2024-11-09 06:15:19,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:15:22,104 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 [0] [2024-11-09 06:15:24,431 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 [0] [2024-11-09 06:15:26,497 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 [0] [2024-11-09 06:15:28,753 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 [0] [2024-11-09 06:15:31,138 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 [0] [2024-11-09 06:15:33,214 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 [0] [2024-11-09 06:15:35,517 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 [0] [2024-11-09 06:15:37,582 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 [0] [2024-11-09 06:15:39,977 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 [0] [2024-11-09 06:15:42,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:15:44,370 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 [0] [2024-11-09 06:15:46,806 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 [0] [2024-11-09 06:15:48,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 [0] [2024-11-09 06:15:51,167 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 [0] [2024-11-09 06:15:53,236 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 [0] [2024-11-09 06:15:55,543 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 [0] [2024-11-09 06:15:57,619 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 [0] [2024-11-09 06:15:59,950 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 [0] [2024-11-09 06:16:02,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 [0] [2024-11-09 06:16:04,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 [0] [2024-11-09 06:16:06,482 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 [0] [2024-11-09 06:16:08,749 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 [0] [2024-11-09 06:16:10,835 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 [0] [2024-11-09 06:16:13,228 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 [0] [2024-11-09 06:16:15,306 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 [0] [2024-11-09 06:16:17,683 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 [0] [2024-11-09 06:16:20,087 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 [0] [2024-11-09 06:16:22,180 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 [0] [2024-11-09 06:16:24,576 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 [0] [2024-11-09 06:16:26,644 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 [0] [2024-11-09 06:16:29,084 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 [0] [2024-11-09 06:16:31,348 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 [0] [2024-11-09 06:16:33,441 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 [0] [2024-11-09 06:16:35,699 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 [0] [2024-11-09 06:16:37,956 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 [0] [2024-11-09 06:16:40,040 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 [0] [2024-11-09 06:16:42,536 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 [0] [2024-11-09 06:16:44,907 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 [0] [2024-11-09 06:16:47,018 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 [0] [2024-11-09 06:16:49,452 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 [0] [2024-11-09 06:16:52,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:16:54,428 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 [0] [2024-11-09 06:16:56,499 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 [0] [2024-11-09 06:16:58,822 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 [0] [2024-11-09 06:17:00,899 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 [0] [2024-11-09 06:17:03,298 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 [0] [2024-11-09 06:17:05,632 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 [0] [2024-11-09 06:17:08,013 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 [0] [2024-11-09 06:17:10,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 [0] [2024-11-09 06:17:12,438 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 [0] [2024-11-09 06:17:14,505 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 [0] [2024-11-09 06:17:16,823 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 [0] [2024-11-09 06:17:18,829 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 [0] [2024-11-09 06:17:20,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:17:22,966 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 [0] [2024-11-09 06:17:24,969 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 [0] [2024-11-09 06:17:26,974 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 [0] [2024-11-09 06:17:28,980 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 [0] [2024-11-09 06:17:30,986 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 [0] [2024-11-09 06:17:32,991 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 [0] [2024-11-09 06:17:34,996 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 [0] [2024-11-09 06:17:37,000 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 [0] [2024-11-09 06:17:39,005 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 [0] [2024-11-09 06:17:41,010 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 [0] [2024-11-09 06:17:43,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 [0] [2024-11-09 06:17:45,019 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 [0] [2024-11-09 06:17:47,024 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 [0] [2024-11-09 06:17:49,028 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 [0] [2024-11-09 06:17:51,033 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 [0] [2024-11-09 06:17:53,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:17:55,124 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 [0] [2024-11-09 06:17:57,146 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 [0] [2024-11-09 06:17:59,150 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 [0] [2024-11-09 06:18:01,160 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 [0] [2024-11-09 06:18:03,175 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 [0] [2024-11-09 06:18:05,180 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 [0] [2024-11-09 06:18:07,185 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 [0]