./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:57:14,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:57:14,544 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 04:57:14,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:57:14,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:57:14,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:57:14,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:57:14,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:57:14,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:57:14,576 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:57:14,576 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:57:14,577 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:57:14,577 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:57:14,577 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:57:14,577 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:57:14,577 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:57:14,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:57:14,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:57:14,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:57:14,578 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:57:14,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:57:14,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:57:14,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:57:14,580 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:57:14,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:57:14,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:57:14,580 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:57:14,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:57:14,580 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-14 04:57:14,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:57:14,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:57:14,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:57:14,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:57:14,898 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:57:14,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i Unable to find full path for "g++" [2024-11-14 04:57:16,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:57:17,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:57:17,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2024-11-14 04:57:17,221 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/data/ca410f61c/ea958395a64c43d3b5e52486c6e5e904/FLAGb2896f67e [2024-11-14 04:57:17,236 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/data/ca410f61c/ea958395a64c43d3b5e52486c6e5e904 [2024-11-14 04:57:17,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:57:17,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:57:17,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:57:17,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:57:17,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:57:17,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:57:17" (1/1) ... [2024-11-14 04:57:17,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41784208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:17, skipping insertion in model container [2024-11-14 04:57:17,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:57:17" (1/1) ... [2024-11-14 04:57:17,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:57:17,789 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-14 04:57:17,848 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-14 04:57:17,853 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-14 04:57:17,859 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-14 04:57:17,867 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-14 04:57:17,932 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-14 04:57:17,933 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-14 04:57:17,935 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-14 04:57:17,936 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-14 04:57:17,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:57:17,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:57:18,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:57:18,117 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:57:18,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18 WrapperNode [2024-11-14 04:57:18,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:57:18,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:57:18,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:57:18,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:57:18,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,237 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-14 04:57:18,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:57:18,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:57:18,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:57:18,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:57:18,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:57:18,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:57:18,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:57:18,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:57:18,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (1/1) ... [2024-11-14 04:57:18,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:57:18,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:57:18,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:57:18,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:57:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 04:57:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:57:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:57:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:57:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:57:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:57:18,673 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:57:18,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:57:18,678 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 04:57:21,363 INFO L? ?]: Removed 1022 outVars from TransFormulas that were not future-live. [2024-11-14 04:57:21,364 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:57:23,075 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:57:23,079 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-14 04:57:23,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:57:23 BoogieIcfgContainer [2024-11-14 04:57:23,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:57:23,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:57:23,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:57:23,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:57:23,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:57:17" (1/3) ... [2024-11-14 04:57:23,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daa6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:57:23, skipping insertion in model container [2024-11-14 04:57:23,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:18" (2/3) ... [2024-11-14 04:57:23,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daa6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:57:23, skipping insertion in model container [2024-11-14 04:57:23,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:57:23" (3/3) ... [2024-11-14 04:57:23,096 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-1.i [2024-11-14 04:57:23,114 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:57:23,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test2-1.i that has 2 procedures, 770 locations, 1 initial locations, 31 loop locations, and 420 error locations. [2024-11-14 04:57:23,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:57:23,199 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;@539924df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:57:23,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-14 04:57:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 770 states, 348 states have (on average 2.4885057471264367) internal successors, (866), 765 states have internal predecessors, (866), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:57:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:57:23,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:57:23,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:57:23,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:57:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:57:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2013809, now seen corresponding path program 1 times [2024-11-14 04:57:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:57:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060692430] [2024-11-14 04:57:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:57:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:57:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:57:23,423 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-14 04:57:23,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:57:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060692430] [2024-11-14 04:57:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060692430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:57:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:57:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:57:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531348903] [2024-11-14 04:57:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:57:23,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:57:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:57:23,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:57:23,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:57:23,456 INFO L87 Difference]: Start difference. First operand has 770 states, 348 states have (on average 2.4885057471264367) internal successors, (866), 765 states have internal predecessors, (866), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:57:26,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:57:28,310 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-14 04:57:30,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:57:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:57:30,598 INFO L93 Difference]: Finished difference Result 757 states and 805 transitions. [2024-11-14 04:57:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:57:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 04:57:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:57:30,612 INFO L225 Difference]: With dead ends: 757 [2024-11-14 04:57:30,612 INFO L226 Difference]: Without dead ends: 756 [2024-11-14 04:57:30,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:57:30,616 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 697 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:57:30,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 436 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 455 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2024-11-14 04:57:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-14 04:57:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2024-11-14 04:57:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 351 states have (on average 2.2735042735042734) internal successors, (798), 751 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:57:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 804 transitions. [2024-11-14 04:57:30,695 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 804 transitions. Word has length 3 [2024-11-14 04:57:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:57:30,695 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 804 transitions. [2024-11-14 04:57:30,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:57:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 804 transitions. [2024-11-14 04:57:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:57:30,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:57:30,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:57:30,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:57:30,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:57:30,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:57:30,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2013810, now seen corresponding path program 1 times [2024-11-14 04:57:30,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:57:30,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815675395] [2024-11-14 04:57:30,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:57:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:57:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:57:30,825 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-14 04:57:30,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:57:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815675395] [2024-11-14 04:57:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815675395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:57:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:57:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:57:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955435751] [2024-11-14 04:57:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:57:30,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:57:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:57:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:57:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:57:30,829 INFO L87 Difference]: Start difference. First operand 756 states and 804 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:57:32,985 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-14 04:57:35,001 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-14 04:57:37,004 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-14 04:57:39,044 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-14 04:57:41,060 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-14 04:57:43,065 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-14 04:57:45,442 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-14 04:57:47,445 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-14 04:57:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:57:48,728 INFO L93 Difference]: Finished difference Result 946 states and 1015 transitions. [2024-11-14 04:57:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:57:48,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 04:57:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:57:48,732 INFO L225 Difference]: With dead ends: 946 [2024-11-14 04:57:48,732 INFO L226 Difference]: Without dead ends: 946 [2024-11-14 04:57:48,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:57:48,733 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 211 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 6 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:57:48,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 995 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 584 Invalid, 8 Unknown, 0 Unchecked, 17.8s Time] [2024-11-14 04:57:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-11-14 04:57:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 860. [2024-11-14 04:57:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 456 states have (on average 2.206140350877193) internal successors, (1006), 855 states have internal predecessors, (1006), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:57:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1012 transitions. [2024-11-14 04:57:48,762 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1012 transitions. Word has length 3 [2024-11-14 04:57:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:57:48,762 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1012 transitions. [2024-11-14 04:57:48,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:57:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1012 transitions. [2024-11-14 04:57:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:57:48,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:57:48,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:57:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:57:48,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:57:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:57:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2015782, now seen corresponding path program 1 times [2024-11-14 04:57:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:57:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096335234] [2024-11-14 04:57:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:57:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:57:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:57:48,902 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-14 04:57:48,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:57:48,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096335234] [2024-11-14 04:57:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096335234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:57:48,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:57:48,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:57:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235286695] [2024-11-14 04:57:48,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:57:48,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:57:48,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:57:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:57:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:57:48,904 INFO L87 Difference]: Start difference. First operand 860 states and 1012 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:57:51,111 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-14 04:57:53,120 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-14 04:57:55,138 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-14 04:57:57,143 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-14 04:57:59,146 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-14 04:58:00,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:58:02,384 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-14 04:58:05,276 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-14 04:58:07,279 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-14 04:58:09,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:58:11,231 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-14 04:58:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:58:11,553 INFO L93 Difference]: Finished difference Result 947 states and 1015 transitions. [2024-11-14 04:58:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:58:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 04:58:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:58:11,557 INFO L225 Difference]: With dead ends: 947 [2024-11-14 04:58:11,558 INFO L226 Difference]: Without dead ends: 945 [2024-11-14 04:58:11,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:58:11,559 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 212 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:58:11,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1370 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1001 Invalid, 9 Unknown, 0 Unchecked, 22.6s Time] [2024-11-14 04:58:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-14 04:58:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 860. [2024-11-14 04:58:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 456 states have (on average 2.2017543859649122) internal successors, (1004), 855 states have internal predecessors, (1004), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:58:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1010 transitions. [2024-11-14 04:58:11,586 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1010 transitions. Word has length 3 [2024-11-14 04:58:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:58:11,586 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1010 transitions. [2024-11-14 04:58:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1010 transitions. [2024-11-14 04:58:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:58:11,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:58:11,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:58:11,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:58:11,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:58:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:58:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -136095752, now seen corresponding path program 1 times [2024-11-14 04:58:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:58:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872328342] [2024-11-14 04:58:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:58:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:58:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:58:11,793 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-14 04:58:11,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:58:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872328342] [2024-11-14 04:58:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872328342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:58:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:58:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:58:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321650533] [2024-11-14 04:58:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:58:11,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:58:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:58:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:58:11,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:58:11,796 INFO L87 Difference]: Start difference. First operand 860 states and 1010 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:13,991 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-14 04:58:16,016 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-14 04:58:17,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:58:19,432 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-14 04:58:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:58:20,188 INFO L93 Difference]: Finished difference Result 849 states and 998 transitions. [2024-11-14 04:58:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:58:20,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 04:58:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:58:20,191 INFO L225 Difference]: With dead ends: 849 [2024-11-14 04:58:20,191 INFO L226 Difference]: Without dead ends: 849 [2024-11-14 04:58:20,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:58:20,192 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1466 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:58:20,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 209 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 653 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2024-11-14 04:58:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-14 04:58:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2024-11-14 04:58:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 456 states have (on average 2.175438596491228) internal successors, (992), 844 states have internal predecessors, (992), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:58:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 998 transitions. [2024-11-14 04:58:20,219 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 998 transitions. Word has length 6 [2024-11-14 04:58:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:58:20,219 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 998 transitions. [2024-11-14 04:58:20,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 998 transitions. [2024-11-14 04:58:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 04:58:20,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:58:20,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:58:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:58:20,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:58:20,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:58:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 75998963, now seen corresponding path program 1 times [2024-11-14 04:58:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:58:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323040365] [2024-11-14 04:58:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:58:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:58:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:58:20,342 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-14 04:58:20,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:58:20,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323040365] [2024-11-14 04:58:20,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323040365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:58:20,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:58:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:58:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265003728] [2024-11-14 04:58:20,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:58:20,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:58:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:58:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:58:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:58:20,344 INFO L87 Difference]: Start difference. First operand 849 states and 998 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:22,486 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-14 04:58:24,491 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-14 04:58:26,507 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-14 04:58:28,536 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-14 04:58:30,540 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-14 04:58:33,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:58:35,360 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-14 04:58:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:58:35,615 INFO L93 Difference]: Finished difference Result 887 states and 953 transitions. [2024-11-14 04:58:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:58:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 04:58:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:58:35,619 INFO L225 Difference]: With dead ends: 887 [2024-11-14 04:58:35,620 INFO L226 Difference]: Without dead ends: 887 [2024-11-14 04:58:35,620 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-14 04:58:35,621 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 665 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 50 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:58:35,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 628 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 580 Invalid, 7 Unknown, 0 Unchecked, 15.2s Time] [2024-11-14 04:58:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-14 04:58:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 802. [2024-11-14 04:58:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 456 states have (on average 2.0723684210526314) internal successors, (945), 797 states have internal predecessors, (945), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:58:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 951 transitions. [2024-11-14 04:58:35,641 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 951 transitions. Word has length 7 [2024-11-14 04:58:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:58:35,641 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 951 transitions. [2024-11-14 04:58:35,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 951 transitions. [2024-11-14 04:58:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 04:58:35,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:58:35,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:58:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:58:35,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:58:35,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:58:35,643 INFO L85 PathProgramCache]: Analyzing trace with hash 75998964, now seen corresponding path program 1 times [2024-11-14 04:58:35,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:58:35,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317803772] [2024-11-14 04:58:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:58:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:58:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:58:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:58:35,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:58:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317803772] [2024-11-14 04:58:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317803772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:58:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:58:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:58:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88400829] [2024-11-14 04:58:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:58:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:58:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:58:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:58:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:58:35,752 INFO L87 Difference]: Start difference. First operand 802 states and 951 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:37,891 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-14 04:58:39,897 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-14 04:58:41,912 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-14 04:58:44,108 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-14 04:58:46,385 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-14 04:58:48,405 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-14 04:58:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:58:48,690 INFO L93 Difference]: Finished difference Result 971 states and 1140 transitions. [2024-11-14 04:58:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:58:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 04:58:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:58:48,694 INFO L225 Difference]: With dead ends: 971 [2024-11-14 04:58:48,694 INFO L226 Difference]: Without dead ends: 971 [2024-11-14 04:58:48,695 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-14 04:58:48,697 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 491 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 26 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:58:48,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 820 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 528 Invalid, 6 Unknown, 0 Unchecked, 12.9s Time] [2024-11-14 04:58:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-14 04:58:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 777. [2024-11-14 04:58:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 456 states have (on average 2.017543859649123) internal successors, (920), 772 states have internal predecessors, (920), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:58:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 926 transitions. [2024-11-14 04:58:48,720 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 926 transitions. Word has length 7 [2024-11-14 04:58:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:58:48,721 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 926 transitions. [2024-11-14 04:58:48,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:58:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 926 transitions. [2024-11-14 04:58:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:58:48,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:58:48,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:58:48,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:58:48,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:58:48,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:58:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1967266148, now seen corresponding path program 1 times [2024-11-14 04:58:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:58:48,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536499010] [2024-11-14 04:58:48,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:58:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:58:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:58:48,832 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-14 04:58:48,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:58:48,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536499010] [2024-11-14 04:58:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536499010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:58:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:58:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:58:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5817355] [2024-11-14 04:58:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:58:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:58:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:58:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:58:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:58:48,837 INFO L87 Difference]: Start difference. First operand 777 states and 926 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-14 04:58:51,024 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-14 04:58:53,042 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-14 04:58:55,046 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-14 04:58:57,080 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-14 04:58:59,090 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-14 04:59:01,093 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-14 04:59:03,101 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-14 04:59:05,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 [] [2024-11-14 04:59:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:59:05,534 INFO L93 Difference]: Finished difference Result 762 states and 888 transitions. [2024-11-14 04:59:05,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:59:05,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-14 04:59:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:59:05,538 INFO L225 Difference]: With dead ends: 762 [2024-11-14 04:59:05,538 INFO L226 Difference]: Without dead ends: 762 [2024-11-14 04:59:05,538 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-14 04:59:05,539 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 667 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:59:05,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 656 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 726 Invalid, 8 Unknown, 0 Unchecked, 16.7s Time] [2024-11-14 04:59:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-14 04:59:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 754. [2024-11-14 04:59:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 456 states have (on average 1.9166666666666667) internal successors, (874), 749 states have internal predecessors, (874), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:59:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 880 transitions. [2024-11-14 04:59:05,555 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 880 transitions. Word has length 13 [2024-11-14 04:59:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:59:05,555 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 880 transitions. [2024-11-14 04:59:05,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-14 04:59:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 880 transitions. [2024-11-14 04:59:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:59:05,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:59:05,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:59:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 04:59:05,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:59:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:59:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1967266149, now seen corresponding path program 1 times [2024-11-14 04:59:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:59:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935150082] [2024-11-14 04:59:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:59:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:05,660 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-14 04:59:05,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:59:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935150082] [2024-11-14 04:59:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935150082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:59:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:59:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:59:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191354227] [2024-11-14 04:59:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:59:05,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:59:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:59:05,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:59:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:59:05,662 INFO L87 Difference]: Start difference. First operand 754 states and 880 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 04:59:07,726 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-14 04:59:09,733 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-14 04:59:11,786 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-14 04:59:13,788 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-14 04:59:15,797 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-14 04:59:17,799 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-14 04:59:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:59:17,931 INFO L93 Difference]: Finished difference Result 712 states and 824 transitions. [2024-11-14 04:59:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:59:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-14 04:59:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:59:17,934 INFO L225 Difference]: With dead ends: 712 [2024-11-14 04:59:17,934 INFO L226 Difference]: Without dead ends: 712 [2024-11-14 04:59:17,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 04:59:17,935 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 50 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:59:17,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1084 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 12.3s Time] [2024-11-14 04:59:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-14 04:59:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2024-11-14 04:59:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 426 states have (on average 1.92018779342723) internal successors, (818), 707 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:59:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 824 transitions. [2024-11-14 04:59:17,949 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 824 transitions. Word has length 13 [2024-11-14 04:59:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:59:17,949 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 824 transitions. [2024-11-14 04:59:17,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 04:59:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 824 transitions. [2024-11-14 04:59:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 04:59:17,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:59:17,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:59:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:59:17,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:59:17,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:59:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash 856756539, now seen corresponding path program 1 times [2024-11-14 04:59:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:59:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076473166] [2024-11-14 04:59:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:59:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:18,020 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-14 04:59:18,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:59:18,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076473166] [2024-11-14 04:59:18,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076473166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:59:18,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:59:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:59:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536250557] [2024-11-14 04:59:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:59:18,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:59:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:59:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:59:18,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:59:18,022 INFO L87 Difference]: Start difference. First operand 712 states and 824 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:20,109 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-14 04:59:21,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:59:24,025 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-14 04:59:26,031 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-14 04:59:28,035 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-14 04:59:30,053 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-14 04:59:32,056 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-14 04:59:34,059 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-14 04:59:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:59:34,231 INFO L93 Difference]: Finished difference Result 697 states and 788 transitions. [2024-11-14 04:59:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:59:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 04:59:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:59:34,234 INFO L225 Difference]: With dead ends: 697 [2024-11-14 04:59:34,234 INFO L226 Difference]: Without dead ends: 697 [2024-11-14 04:59:34,234 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-14 04:59:34,235 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 38 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 15 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:59:34,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1591 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 269 Invalid, 7 Unknown, 0 Unchecked, 16.2s Time] [2024-11-14 04:59:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-14 04:59:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2024-11-14 04:59:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 412 states have (on average 1.883495145631068) internal successors, (776), 686 states have internal predecessors, (776), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:59:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 782 transitions. [2024-11-14 04:59:34,248 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 782 transitions. Word has length 14 [2024-11-14 04:59:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:59:34,248 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 782 transitions. [2024-11-14 04:59:34,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 782 transitions. [2024-11-14 04:59:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 04:59:34,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:59:34,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:59:34,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:59:34,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:59:34,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:59:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 52769994, now seen corresponding path program 1 times [2024-11-14 04:59:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:59:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874595878] [2024-11-14 04:59:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:59:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:34,325 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-14 04:59:34,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:59:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874595878] [2024-11-14 04:59:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874595878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:59:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:59:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:59:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345166447] [2024-11-14 04:59:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:59:34,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:59:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:59:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:59:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:59:34,327 INFO L87 Difference]: Start difference. First operand 691 states and 782 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:36,458 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-14 04:59:38,502 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-14 04:59:39,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:59:40,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:59:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:59:41,740 INFO L93 Difference]: Finished difference Result 715 states and 765 transitions. [2024-11-14 04:59:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:59:41,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 04:59:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:59:41,742 INFO L225 Difference]: With dead ends: 715 [2024-11-14 04:59:41,742 INFO L226 Difference]: Without dead ends: 715 [2024-11-14 04:59:41,743 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-14 04:59:41,743 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 629 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:59:41,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 799 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2024-11-14 04:59:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-14 04:59:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 668. [2024-11-14 04:59:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 412 states have (on average 1.8276699029126213) internal successors, (753), 663 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:59:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 759 transitions. [2024-11-14 04:59:41,756 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 759 transitions. Word has length 15 [2024-11-14 04:59:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:59:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 759 transitions. [2024-11-14 04:59:41,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 759 transitions. [2024-11-14 04:59:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 04:59:41,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:59:41,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:59:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:59:41,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:59:41,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:59:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash 52769995, now seen corresponding path program 1 times [2024-11-14 04:59:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:59:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687597125] [2024-11-14 04:59:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:59:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:41,824 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-14 04:59:41,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:59:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687597125] [2024-11-14 04:59:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687597125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:59:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:59:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:59:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942897817] [2024-11-14 04:59:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:59:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:59:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:59:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:59:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:59:41,826 INFO L87 Difference]: Start difference. First operand 668 states and 759 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:43,887 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-14 04:59:45,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:59:47,436 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-14 04:59:49,439 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-14 04:59:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:59:49,600 INFO L93 Difference]: Finished difference Result 641 states and 731 transitions. [2024-11-14 04:59:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:59:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 04:59:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:59:49,603 INFO L225 Difference]: With dead ends: 641 [2024-11-14 04:59:49,603 INFO L226 Difference]: Without dead ends: 641 [2024-11-14 04:59:49,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 04:59:49,603 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 50 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:59:49,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 962 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2024-11-14 04:59:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-14 04:59:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2024-11-14 04:59:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 397 states have (on average 1.8261964735516374) internal successors, (725), 636 states have internal predecessors, (725), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:59:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 731 transitions. [2024-11-14 04:59:49,617 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 731 transitions. Word has length 15 [2024-11-14 04:59:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:59:49,618 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 731 transitions. [2024-11-14 04:59:49,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 731 transitions. [2024-11-14 04:59:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:59:49,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:59:49,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:59:49,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:59:49,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 04:59:49,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:59:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1638121763, now seen corresponding path program 1 times [2024-11-14 04:59:49,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:59:49,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768432128] [2024-11-14 04:59:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:59:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:59:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:59:49,723 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-14 04:59:49,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:59:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768432128] [2024-11-14 04:59:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768432128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:59:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:59:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:59:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619788114] [2024-11-14 04:59:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:59:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:59:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:59:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:59:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:59:49,725 INFO L87 Difference]: Start difference. First operand 641 states and 731 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:59:51,812 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-14 04:59:53,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:59:55,818 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-14 04:59:57,828 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-14 04:59:59,831 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-14 05:00:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:00:00,686 INFO L93 Difference]: Finished difference Result 630 states and 713 transitions. [2024-11-14 05:00:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:00:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 05:00:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:00:00,690 INFO L225 Difference]: With dead ends: 630 [2024-11-14 05:00:00,690 INFO L226 Difference]: Without dead ends: 630 [2024-11-14 05:00:00,690 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-14 05:00:00,691 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 38 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:00:00,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1408 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 238 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2024-11-14 05:00:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-14 05:00:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 627. [2024-11-14 05:00:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 390 states have (on average 1.8051282051282052) internal successors, (704), 622 states have internal predecessors, (704), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:00:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 710 transitions. [2024-11-14 05:00:00,702 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 710 transitions. Word has length 16 [2024-11-14 05:00:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:00:00,702 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 710 transitions. [2024-11-14 05:00:00,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:00:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 710 transitions. [2024-11-14 05:00:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:00:00,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:00,703 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] [2024-11-14 05:00:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:00:00,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:00:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -893392503, now seen corresponding path program 1 times [2024-11-14 05:00:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565994009] [2024-11-14 05:00:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:00,854 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-14 05:00:00,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:00,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565994009] [2024-11-14 05:00:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565994009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:00:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145321239] [2024-11-14 05:00:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:00,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:00:00,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:00,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:00:00,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:00:00,856 INFO L87 Difference]: Start difference. First operand 627 states and 710 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-14 05:00:02,936 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-14 05:00:04,946 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-14 05:00:06,951 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-14 05:00:08,959 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-14 05:00:10,962 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-14 05:00:12,968 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-14 05:00:15,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-14 05:00:17,284 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-14 05:00:19,289 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-14 05:00:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:00:19,613 INFO L93 Difference]: Finished difference Result 670 states and 712 transitions. [2024-11-14 05:00:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:00:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-11-14 05:00:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:00:19,616 INFO L225 Difference]: With dead ends: 670 [2024-11-14 05:00:19,616 INFO L226 Difference]: Without dead ends: 670 [2024-11-14 05:00:19,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:00:19,617 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 146 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 3 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:00:19,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 968 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 721 Invalid, 9 Unknown, 0 Unchecked, 18.7s Time] [2024-11-14 05:00:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-14 05:00:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 627. [2024-11-14 05:00:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 390 states have (on average 1.794871794871795) internal successors, (700), 622 states have internal predecessors, (700), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:00:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 706 transitions. [2024-11-14 05:00:19,631 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 706 transitions. Word has length 28 [2024-11-14 05:00:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:00:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 706 transitions. [2024-11-14 05:00:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-14 05:00:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 706 transitions. [2024-11-14 05:00:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:00:19,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:19,633 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] [2024-11-14 05:00:19,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:00:19,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:00:19,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1368008305, now seen corresponding path program 1 times [2024-11-14 05:00:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:19,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8916984] [2024-11-14 05:00:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:19,818 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-14 05:00:19,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8916984] [2024-11-14 05:00:19,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8916984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:19,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:19,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:00:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162892168] [2024-11-14 05:00:19,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:19,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:00:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:00:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:00:19,820 INFO L87 Difference]: Start difference. First operand 627 states and 706 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 05:00:21,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:00:24,807 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-14 05:00:26,818 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-14 05:00:28,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:00:31,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-14 05:00:33,131 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-14 05:00:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:00:33,466 INFO L93 Difference]: Finished difference Result 829 states and 923 transitions. [2024-11-14 05:00:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:00:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-14 05:00:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:00:33,468 INFO L225 Difference]: With dead ends: 829 [2024-11-14 05:00:33,468 INFO L226 Difference]: Without dead ends: 829 [2024-11-14 05:00:33,468 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-14 05:00:33,469 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 313 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:00:33,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1042 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 791 Invalid, 6 Unknown, 0 Unchecked, 13.6s Time] [2024-11-14 05:00:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-14 05:00:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 623. [2024-11-14 05:00:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 390 states have (on average 1.7846153846153847) internal successors, (696), 618 states have internal predecessors, (696), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:00:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 702 transitions. [2024-11-14 05:00:33,479 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 702 transitions. Word has length 30 [2024-11-14 05:00:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:00:33,480 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 702 transitions. [2024-11-14 05:00:33,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 05:00:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 702 transitions. [2024-11-14 05:00:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 05:00:33,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:33,482 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-14 05:00:33,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:00:33,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:00:33,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2072591653, now seen corresponding path program 1 times [2024-11-14 05:00:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:33,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881383219] [2024-11-14 05:00:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:33,603 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-14 05:00:33,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881383219] [2024-11-14 05:00:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881383219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:33,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:00:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239322431] [2024-11-14 05:00:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:33,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:00:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:00:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:00:33,605 INFO L87 Difference]: Start difference. First operand 623 states and 702 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-14 05:00:35,681 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-14 05:00:37,684 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-14 05:00:39,687 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-14 05:00:41,697 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-14 05:00:43,700 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-14 05:00:45,703 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-14 05:00:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:00:45,858 INFO L93 Difference]: Finished difference Result 623 states and 694 transitions. [2024-11-14 05:00:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:00:45,859 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-14 05:00:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:00:45,860 INFO L225 Difference]: With dead ends: 623 [2024-11-14 05:00:45,861 INFO L226 Difference]: Without dead ends: 623 [2024-11-14 05:00:45,861 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-14 05:00:45,861 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 21 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:00:45,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1390 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 6 Unknown, 0 Unchecked, 12.2s Time] [2024-11-14 05:00:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-14 05:00:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-14 05:00:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 390 states have (on average 1.764102564102564) internal successors, (688), 618 states have internal predecessors, (688), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:00:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 694 transitions. [2024-11-14 05:00:45,872 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 694 transitions. Word has length 42 [2024-11-14 05:00:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:00:45,874 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 694 transitions. [2024-11-14 05:00:45,874 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-14 05:00:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 694 transitions. [2024-11-14 05:00:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 05:00:45,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:45,877 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-14 05:00:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:00:45,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:00:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -387671578, now seen corresponding path program 1 times [2024-11-14 05:00:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931684531] [2024-11-14 05:00:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:46,110 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-14 05:00:46,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931684531] [2024-11-14 05:00:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931684531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:00:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664935869] [2024-11-14 05:00:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:00:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:46,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:00:46,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:00:46,112 INFO L87 Difference]: Start difference. First operand 623 states and 694 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-14 05:00:48,192 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-14 05:00:50,198 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-14 05:00:51,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:00:53,581 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-14 05:00:55,584 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-14 05:00:57,586 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-14 05:00:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:00:57,724 INFO L93 Difference]: Finished difference Result 623 states and 690 transitions. [2024-11-14 05:00:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:00:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-14 05:00:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:00:57,726 INFO L225 Difference]: With dead ends: 623 [2024-11-14 05:00:57,726 INFO L226 Difference]: Without dead ends: 623 [2024-11-14 05:00:57,726 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-14 05:00:57,726 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 15 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:00:57,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1384 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 5 Unknown, 0 Unchecked, 11.6s Time] [2024-11-14 05:00:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-14 05:00:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-14 05:00:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 390 states have (on average 1.7538461538461538) internal successors, (684), 618 states have internal predecessors, (684), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:00:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 690 transitions. [2024-11-14 05:00:57,736 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 690 transitions. Word has length 46 [2024-11-14 05:00:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:00:57,736 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 690 transitions. [2024-11-14 05:00:57,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-14 05:00:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 690 transitions. [2024-11-14 05:00:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 05:00:57,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:57,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:00:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:00:57,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:00:57,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash -963207322, now seen corresponding path program 1 times [2024-11-14 05:00:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426532831] [2024-11-14 05:00:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:57,888 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-14 05:00:57,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:57,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426532831] [2024-11-14 05:00:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426532831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:57,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:57,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:00:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239272186] [2024-11-14 05:00:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:57,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:00:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:00:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:00:57,890 INFO L87 Difference]: Start difference. First operand 623 states and 690 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-14 05:00:59,922 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-14 05:01:01,931 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-14 05:01:04,014 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-14 05:01:06,018 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-14 05:01:08,025 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-14 05:01:10,028 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-14 05:01:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:10,129 INFO L93 Difference]: Finished difference Result 691 states and 715 transitions. [2024-11-14 05:01:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:10,130 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-14 05:01:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:10,132 INFO L225 Difference]: With dead ends: 691 [2024-11-14 05:01:10,132 INFO L226 Difference]: Without dead ends: 691 [2024-11-14 05:01:10,132 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-14 05:01:10,133 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 63 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:10,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 921 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 12.2s Time] [2024-11-14 05:01:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-14 05:01:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 681. [2024-11-14 05:01:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 448 states have (on average 1.5736607142857142) internal successors, (705), 676 states have internal predecessors, (705), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:01:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 711 transitions. [2024-11-14 05:01:10,143 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 711 transitions. Word has length 46 [2024-11-14 05:01:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:10,143 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 711 transitions. [2024-11-14 05:01:10,143 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-14 05:01:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 711 transitions. [2024-11-14 05:01:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 05:01:10,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:10,144 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] [2024-11-14 05:01:10,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:01:10,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:01:10,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1850469172, now seen corresponding path program 1 times [2024-11-14 05:01:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681906626] [2024-11-14 05:01:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:10,809 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-14 05:01:10,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:10,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681906626] [2024-11-14 05:01:10,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681906626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:10,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:10,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:01:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235739803] [2024-11-14 05:01:10,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:10,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:01:10,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:01:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:10,812 INFO L87 Difference]: Start difference. First operand 681 states and 711 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-14 05:01:13,956 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-14 05:01:15,959 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-14 05:01:17,967 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-14 05:01:19,970 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-14 05:01:21,972 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-14 05:01:24,046 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-14 05:01:26,049 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-14 05:01:28,051 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-14 05:01:30,055 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-14 05:01:32,057 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-14 05:01:34,060 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-14 05:01:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:34,183 INFO L93 Difference]: Finished difference Result 768 states and 805 transitions. [2024-11-14 05:01:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:01:34,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2024-11-14 05:01:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:34,185 INFO L225 Difference]: With dead ends: 768 [2024-11-14 05:01:34,185 INFO L226 Difference]: Without dead ends: 765 [2024-11-14 05:01:34,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:01:34,185 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 136 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:34,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2432 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 465 Invalid, 11 Unknown, 0 Unchecked, 23.3s Time] [2024-11-14 05:01:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-14 05:01:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 633. [2024-11-14 05:01:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 400 states have (on average 1.6375) internal successors, (655), 628 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:01:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 661 transitions. [2024-11-14 05:01:34,194 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 661 transitions. Word has length 52 [2024-11-14 05:01:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:34,195 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 661 transitions. [2024-11-14 05:01:34,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-14 05:01:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 661 transitions. [2024-11-14 05:01:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 05:01:34,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:34,196 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] [2024-11-14 05:01:34,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:01:34,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:01:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash -672948275, now seen corresponding path program 1 times [2024-11-14 05:01:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517498601] [2024-11-14 05:01:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:34,838 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-14 05:01:34,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517498601] [2024-11-14 05:01:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517498601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282442884] [2024-11-14 05:01:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:01:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:34,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:01:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:34,840 INFO L87 Difference]: Start difference. First operand 633 states and 661 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-14 05:01:36,933 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-14 05:01:38,936 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-14 05:01:40,940 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-14 05:01:42,945 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-14 05:01:44,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:01:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:45,166 INFO L93 Difference]: Finished difference Result 632 states and 660 transitions. [2024-11-14 05:01:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:01:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2024-11-14 05:01:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:45,168 INFO L225 Difference]: With dead ends: 632 [2024-11-14 05:01:45,168 INFO L226 Difference]: Without dead ends: 632 [2024-11-14 05:01:45,168 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-14 05:01:45,169 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 2 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:45,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1221 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 979 Invalid, 4 Unknown, 0 Unchecked, 10.3s Time] [2024-11-14 05:01:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-14 05:01:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2024-11-14 05:01:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 400 states have (on average 1.635) internal successors, (654), 627 states have internal predecessors, (654), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:01:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 660 transitions. [2024-11-14 05:01:45,177 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 660 transitions. Word has length 57 [2024-11-14 05:01:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:45,178 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 660 transitions. [2024-11-14 05:01:45,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-14 05:01:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 660 transitions. [2024-11-14 05:01:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 05:01:45,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:45,179 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] [2024-11-14 05:01:45,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:01:45,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:01:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -672948276, now seen corresponding path program 1 times [2024-11-14 05:01:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948274805] [2024-11-14 05:01:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:45,498 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-14 05:01:45,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:45,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948274805] [2024-11-14 05:01:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948274805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:45,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241355590] [2024-11-14 05:01:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:01:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:01:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:45,499 INFO L87 Difference]: Start difference. First operand 632 states and 660 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-14 05:01:47,557 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-14 05:01:49,562 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-14 05:01:51,566 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-14 05:01:53,568 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-14 05:01:55,839 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-14 05:01:57,841 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-14 05:01:59,843 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-14 05:02:01,852 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-14 05:02:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:02,228 INFO L93 Difference]: Finished difference Result 631 states and 659 transitions. [2024-11-14 05:02:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:02:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2024-11-14 05:02:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:02,230 INFO L225 Difference]: With dead ends: 631 [2024-11-14 05:02:02,230 INFO L226 Difference]: Without dead ends: 631 [2024-11-14 05:02:02,230 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-14 05:02:02,230 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:02,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1262 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 8 Unknown, 0 Unchecked, 16.7s Time] [2024-11-14 05:02:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-14 05:02:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2024-11-14 05:02:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 399 states have (on average 1.636591478696742) internal successors, (653), 626 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:02:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 659 transitions. [2024-11-14 05:02:02,239 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 659 transitions. Word has length 57 [2024-11-14 05:02:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 659 transitions. [2024-11-14 05:02:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-14 05:02:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 659 transitions. [2024-11-14 05:02:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:02:02,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:02,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:02,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-14 05:02:02,241 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:02:02,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1244565682, now seen corresponding path program 1 times [2024-11-14 05:02:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736938587] [2024-11-14 05:02:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:02,566 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-14 05:02:02,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736938587] [2024-11-14 05:02:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736938587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:02,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:02:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:02:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620404674] [2024-11-14 05:02:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:02:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:02:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:02,571 INFO L87 Difference]: Start difference. First operand 631 states and 659 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-14 05:02:04,639 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-14 05:02:06,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:02:08,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 [] [2024-11-14 05:02:10,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:02:12,674 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-14 05:02:14,678 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-14 05:02:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:15,976 INFO L93 Difference]: Finished difference Result 641 states and 672 transitions. [2024-11-14 05:02:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:02:15,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 63 [2024-11-14 05:02:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:15,980 INFO L225 Difference]: With dead ends: 641 [2024-11-14 05:02:15,980 INFO L226 Difference]: Without dead ends: 641 [2024-11-14 05:02:15,980 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-14 05:02:15,981 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 5 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:15,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1741 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1012 Invalid, 6 Unknown, 0 Unchecked, 13.4s Time] [2024-11-14 05:02:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-14 05:02:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 636. [2024-11-14 05:02:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 403 states have (on average 1.6352357320099256) internal successors, (659), 630 states have internal predecessors, (659), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:02:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 668 transitions. [2024-11-14 05:02:15,993 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 668 transitions. Word has length 63 [2024-11-14 05:02:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:15,994 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 668 transitions. [2024-11-14 05:02:15,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-14 05:02:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 668 transitions. [2024-11-14 05:02:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:02:15,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:15,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:15,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 05:02:15,995 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:02:15,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1244565683, now seen corresponding path program 1 times [2024-11-14 05:02:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:15,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125344866] [2024-11-14 05:02:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:16,631 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-14 05:02:16,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125344866] [2024-11-14 05:02:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125344866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:02:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:02:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498559824] [2024-11-14 05:02:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:02:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:02:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:02:16,633 INFO L87 Difference]: Start difference. First operand 636 states and 668 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-14 05:02:18,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:02:20,509 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-14 05:02:22,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-14 05:02:24,515 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-14 05:02:26,518 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-14 05:02:28,521 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-14 05:02:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:29,000 INFO L93 Difference]: Finished difference Result 636 states and 667 transitions. [2024-11-14 05:02:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:02:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 63 [2024-11-14 05:02:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:29,004 INFO L225 Difference]: With dead ends: 636 [2024-11-14 05:02:29,004 INFO L226 Difference]: Without dead ends: 636 [2024-11-14 05:02:29,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:29,008 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:29,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1608 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1138 Invalid, 5 Unknown, 0 Unchecked, 12.3s Time] [2024-11-14 05:02:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-14 05:02:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-11-14 05:02:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 403 states have (on average 1.6327543424317619) internal successors, (658), 630 states have internal predecessors, (658), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:02:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 667 transitions. [2024-11-14 05:02:29,025 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 667 transitions. Word has length 63 [2024-11-14 05:02:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:29,025 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 667 transitions. [2024-11-14 05:02:29,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-14 05:02:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 667 transitions. [2024-11-14 05:02:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:02:29,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:29,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:29,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 05:02:29,027 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:02:29,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1185304607, now seen corresponding path program 1 times [2024-11-14 05:02:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:29,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550857477] [2024-11-14 05:02:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:29,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:29,675 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-14 05:02:29,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550857477] [2024-11-14 05:02:29,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550857477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976391132] [2024-11-14 05:02:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:29,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:29,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:29,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:29,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:02:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:29,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:02:29,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:29,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:02:30,097 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:02:30,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:02:30,140 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-14 05:02:30,235 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-14 05:02:30,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:02:30,412 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-14 05:02:30,497 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-14 05:02:30,539 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-14 05:02:30,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:30,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-14 05:02:30,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976391132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1622751873] [2024-11-14 05:02:30,612 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2024-11-14 05:02:30,612 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:02:30,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:02:30,620 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:02:30,621 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:02:37,294 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-14 05:02:37,617 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:05:55,478 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '32715#(and (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_18|))) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#valid_629| (Array Int Int)) (|v_#length_613| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= 40 (select |v_#length_613| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (store |v_#length_613| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_629| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (store |v_#valid_629| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_629| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|))) (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_423| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_420|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_423|) (= (store |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_422|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32))))))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_18|))) (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_423| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_420|) (= (store |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_3|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_423|) (= (store |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_422|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#valid_629| (Array Int Int)) (|v_#length_613| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_613| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (select |v_#valid_629| |ULTIMATE.start_main_~user~0#1.base|) 1) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#valid_629| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_629| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|) (= (store |v_#length_613| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))))) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem56#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-14 05:05:55,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:05:55,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:05:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-14 05:05:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432083295] [2024-11-14 05:05:55,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:05:55,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:05:55,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:05:55,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2715, Unknown=96, NotChecked=108, Total=3192 [2024-11-14 05:05:55,483 INFO L87 Difference]: Start difference. First operand 636 states and 667 transitions. Second operand has 19 states, 16 states have (on average 6.75) internal successors, (108), 18 states have internal predecessors, (108), 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-14 05:05:58,064 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-14 05:06:00,075 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-14 05:06:02,082 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-14 05:06:04,086 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-14 05:06:06,088 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-14 05:06:08,092 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-14 05:06:10,097 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-14 05:06:11,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:17,834 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-14 05:06:19,837 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-14 05:06:21,847 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-14 05:06:23,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:25,855 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-14 05:06:27,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:06:29,862 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-14 05:06:31,868 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-14 05:06:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:06:39,975 INFO L93 Difference]: Finished difference Result 640 states and 671 transitions. [2024-11-14 05:06:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:06:39,975 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.75) internal successors, (108), 18 states have internal predecessors, (108), 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 64 [2024-11-14 05:06:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:06:39,978 INFO L225 Difference]: With dead ends: 640 [2024-11-14 05:06:39,978 INFO L226 Difference]: Without dead ends: 640 [2024-11-14 05:06:39,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 198.6s TimeCoverageRelationStatistics Valid=305, Invalid=3141, Unknown=98, NotChecked=116, Total=3660 [2024-11-14 05:06:39,981 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 478 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 16 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 3400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:06:39,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2622 Invalid, 3400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3369 Invalid, 15 Unknown, 0 Unchecked, 43.9s Time] [2024-11-14 05:06:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-14 05:06:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2024-11-14 05:06:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 405 states have (on average 1.6296296296296295) internal successors, (660), 631 states have internal predecessors, (660), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:06:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 667 transitions. [2024-11-14 05:06:39,999 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 667 transitions. Word has length 64 [2024-11-14 05:06:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:06:39,999 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 667 transitions. [2024-11-14 05:06:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.75) internal successors, (108), 18 states have internal predecessors, (108), 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-14 05:06:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 667 transitions. [2024-11-14 05:06:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:06:40,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:06:40,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:06:40,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:06:40,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:06:40,206 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:06:40,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:06:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1185304608, now seen corresponding path program 1 times [2024-11-14 05:06:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:06:40,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020182140] [2024-11-14 05:06:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:40,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:06:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:41,663 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-14 05:06:41,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:06:41,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020182140] [2024-11-14 05:06:41,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020182140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:41,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649287835] [2024-11-14 05:06:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:06:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:06:41,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:06:41,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:06:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:41,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:06:41,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:41,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:06:42,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:06:42,320 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-14 05:06:42,410 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-14 05:06:42,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:06:42,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:42,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-14 05:06:42,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-14 05:06:43,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-14 05:06:43,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-14 05:06:43,210 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-14 05:06:43,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:06:43,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:06:43,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-14 05:06:44,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649287835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:44,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035550097] [2024-11-14 05:06:44,159 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2024-11-14 05:06:44,159 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:06:44,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:06:44,161 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:06:44,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:06:50,362 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 05:06:50,961 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:10:24,061 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '34261#(and (or (and (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_#memory_int_439| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_#memory_int_442| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_441|) (= (store |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_5|) (= |v_#memory_int_439| (store |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_442|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_618| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#valid_634| (Array Int Int)) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_618| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= (select |v_#valid_634| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |#length| (store |v_#length_618| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (select |v_#valid_634| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#valid| (store |v_#valid_634| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1)))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr226_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr226_30|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_30| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_30| 4294967296)))) (exists ((|v_#length_618| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#valid_634| (Array Int Int)) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int)))) (and (= |#length| (store |v_#length_618| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_618| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= 0 (select |v_#valid_634| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8))) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (store |v_#valid_634| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_634| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_#memory_int_439| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_442| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_441|) (= |v_#memory_int_439| (store |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_442|))))) (<= 1 |#StackHeapBarrier|) (or (< (+ 16 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-14 05:10:24,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:10:24,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:10:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-14 05:10:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723681131] [2024-11-14 05:10:24,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:10:24,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:10:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:24,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:10:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2995, Unknown=141, NotChecked=0, Total=3422 [2024-11-14 05:10:24,064 INFO L87 Difference]: Start difference. First operand 638 states and 667 transitions. Second operand has 19 states, 16 states have (on average 6.75) internal successors, (108), 19 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:10:26,595 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-14 05:10:28,599 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-14 05:10:36,575 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-14 05:10:37,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:10:39,597 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-14 05:10:41,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:10:43,615 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-14 05:10:45,622 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-14 05:10:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:10:55,490 INFO L93 Difference]: Finished difference Result 639 states and 670 transitions. [2024-11-14 05:10:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:10:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.75) internal successors, (108), 19 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2024-11-14 05:10:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:10:55,493 INFO L225 Difference]: With dead ends: 639 [2024-11-14 05:10:55,493 INFO L226 Difference]: Without dead ends: 639 [2024-11-14 05:10:55,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 215.1s TimeCoverageRelationStatistics Valid=328, Invalid=3435, Unknown=143, NotChecked=0, Total=3906 [2024-11-14 05:10:55,495 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 483 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 4180 mSolverCounterSat, 17 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 4204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4180 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:10:55,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2366 Invalid, 4204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4180 Invalid, 7 Unknown, 0 Unchecked, 30.7s Time] [2024-11-14 05:10:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-14 05:10:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 632. [2024-11-14 05:10:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 401 states have (on average 1.6309226932668328) internal successors, (654), 626 states have internal predecessors, (654), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:10:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 660 transitions. [2024-11-14 05:10:55,508 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 660 transitions. Word has length 64 [2024-11-14 05:10:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:10:55,509 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 660 transitions. [2024-11-14 05:10:55,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.75) internal successors, (108), 19 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:10:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 660 transitions. [2024-11-14 05:10:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 05:10:55,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:10:55,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:10:55,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:10:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:55,714 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:10:55,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:10:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2028156127, now seen corresponding path program 1 times [2024-11-14 05:10:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:10:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44690449] [2024-11-14 05:10:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:55,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:10:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:56,961 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-14 05:10:56,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:10:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44690449] [2024-11-14 05:10:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44690449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:10:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:10:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 05:10:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909988552] [2024-11-14 05:10:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:10:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:10:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:10:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:10:56,965 INFO L87 Difference]: Start difference. First operand 632 states and 660 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 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-14 05:11:03,895 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-14 05:11:05,906 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-14 05:11:07,909 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-14 05:11:09,912 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-14 05:11:11,915 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-14 05:11:13,920 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-14 05:11:15,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:11:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:11:21,025 INFO L93 Difference]: Finished difference Result 642 states and 673 transitions. [2024-11-14 05:11:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:11:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 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 65 [2024-11-14 05:11:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:11:21,028 INFO L225 Difference]: With dead ends: 642 [2024-11-14 05:11:21,028 INFO L226 Difference]: Without dead ends: 642 [2024-11-14 05:11:21,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:11:21,029 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 509 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 12 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:11:21,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2382 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3080 Invalid, 6 Unknown, 0 Unchecked, 23.6s Time] [2024-11-14 05:11:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-14 05:11:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 639. [2024-11-14 05:11:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 407 states have (on average 1.6265356265356266) internal successors, (662), 632 states have internal predecessors, (662), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:11:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 669 transitions. [2024-11-14 05:11:21,040 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 669 transitions. Word has length 65 [2024-11-14 05:11:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:11:21,040 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 669 transitions. [2024-11-14 05:11:21,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 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-14 05:11:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 669 transitions. [2024-11-14 05:11:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 05:11:21,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:11:21,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:11:21,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-14 05:11:21,041 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:11:21,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:11:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2028156128, now seen corresponding path program 1 times [2024-11-14 05:11:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:11:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262058666] [2024-11-14 05:11:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:11:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:22,481 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-14 05:11:22,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:11:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262058666] [2024-11-14 05:11:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262058666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:11:22,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:11:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:11:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916229668] [2024-11-14 05:11:22,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:11:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:11:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:11:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:11:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:11:22,485 INFO L87 Difference]: Start difference. First operand 639 states and 669 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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-14 05:11:24,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:11:25,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:11:30,299 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-14 05:11:32,303 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-14 05:11:34,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 [] [2024-11-14 05:11:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:11:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:11:40,542 INFO L93 Difference]: Finished difference Result 641 states and 672 transitions. [2024-11-14 05:11:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:11:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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 65 [2024-11-14 05:11:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:11:40,545 INFO L225 Difference]: With dead ends: 641 [2024-11-14 05:11:40,545 INFO L226 Difference]: Without dead ends: 641 [2024-11-14 05:11:40,545 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-14 05:11:40,546 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 491 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:11:40,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1362 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2483 Invalid, 3 Unknown, 0 Unchecked, 17.8s Time] [2024-11-14 05:11:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-14 05:11:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2024-11-14 05:11:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 407 states have (on average 1.624078624078624) internal successors, (661), 632 states have internal predecessors, (661), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:11:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 668 transitions. [2024-11-14 05:11:40,556 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 668 transitions. Word has length 65 [2024-11-14 05:11:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:11:40,557 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 668 transitions. [2024-11-14 05:11:40,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 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-14 05:11:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 668 transitions. [2024-11-14 05:11:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 05:11:40,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:11:40,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:11:40,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 05:11:40,558 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-14 05:11:40,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:11:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 912837900, now seen corresponding path program 1 times [2024-11-14 05:11:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:11:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894413055] [2024-11-14 05:11:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:11:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:41,945 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-14 05:11:41,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:11:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894413055] [2024-11-14 05:11:41,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894413055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860350214] [2024-11-14 05:11:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:11:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:11:41,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:11:41,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_122298c2-df6f-420a-81a9-70aaa42bfdcb/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:11:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:42,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:11:42,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:11:42,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:11:42,589 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:11:42,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:11:42,701 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-14 05:11:42,929 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-14 05:11:43,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:43,315 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-14 05:11:43,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:43,596 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-14 05:11:43,624 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-14 05:11:43,763 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-14 05:11:43,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:11:43,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1069 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-14 05:11:43,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1069 (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_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-14 05:11:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860350214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2022032420] [2024-11-14 05:11:44,059 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2024-11-14 05:11:44,059 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:11:44,060 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:11:44,060 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:11:44,060 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:11:50,246 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-14 05:11:50,485 INFO L180 IcfgInterpreter]: Interpretation finished