./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_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_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/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_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/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_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/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 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:25:22,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:25:22,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:25:22,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:25:22,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:25:22,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:25:22,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:25:22,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:25:22,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:25:22,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:25:22,725 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:25:22,725 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:25:22,725 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:25:22,725 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:25:22,725 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:25:22,725 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:25:22,726 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:25:22,726 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:25:22,726 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:25:22,726 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:25:22,726 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:25:22,726 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:25:22,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:25:22,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:25:22,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:25:22,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:25:22,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:25:22,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:25:22,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:25:22,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:25:22,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:25:22,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:25:22,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:25:22,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:25:22,730 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_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2024-11-14 03:25:23,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:25:23,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:25:23,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:25:23,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:25:23,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:25:23,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i Unable to find full path for "g++" [2024-11-14 03:25:24,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:25:25,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:25:25,308 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-14 03:25:25,327 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/data/4b675bb2d/c45c800475ab44909dc94198f3a35517/FLAGfab4762ad [2024-11-14 03:25:25,342 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/data/4b675bb2d/c45c800475ab44909dc94198f3a35517 [2024-11-14 03:25:25,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:25:25,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:25:25,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:25:25,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:25:25,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:25:25,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:25:25" (1/1) ... [2024-11-14 03:25:25,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3d09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:25, skipping insertion in model container [2024-11-14 03:25:25,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:25:25" (1/1) ... [2024-11-14 03:25:25,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:25:25,907 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 03:25:25,972 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 03:25:25,979 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 03:25:25,984 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 03:25:25,991 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 03:25:26,028 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 03:25:26,028 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 03:25:26,031 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:25:26,031 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:25:26,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:25:26,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:25:26,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:25:26,265 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:25:26,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26 WrapperNode [2024-11-14 03:25:26,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:25:26,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:25:26,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:25:26,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:25:26,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,387 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-14 03:25:26,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:25:26,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:25:26,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:25:26,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:25:26,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:25:26,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:25:26,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:25:26,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:25:26,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (1/1) ... [2024-11-14 03:25:26,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:25:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:25:26,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:25:26,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:25:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 03:25:26,589 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 03:25:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 03:25:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 03:25:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:25:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:25:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:25:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:25:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 03:25:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 03:25:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:25:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:25:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:25:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:25:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:25:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:25:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:25:26,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:25:26,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:25:26,912 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 03:25:29,683 INFO L? ?]: Removed 1036 outVars from TransFormulas that were not future-live. [2024-11-14 03:25:29,683 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:25:31,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:25:31,500 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-14 03:25:31,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:25:31 BoogieIcfgContainer [2024-11-14 03:25:31,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:25:31,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:25:31,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:25:31,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:25:31,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:25:25" (1/3) ... [2024-11-14 03:25:31,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5758dea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:25:31, skipping insertion in model container [2024-11-14 03:25:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:26" (2/3) ... [2024-11-14 03:25:31,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5758dea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:25:31, skipping insertion in model container [2024-11-14 03:25:31,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:25:31" (3/3) ... [2024-11-14 03:25:31,516 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2024-11-14 03:25:31,533 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:25:31,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test2-1.i that has 4 procedures, 791 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2024-11-14 03:25:31,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:25:31,628 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;@1d349d2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:25:31,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-14 03:25:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 791 states, 356 states have (on average 2.480337078651685) internal successors, (883), 784 states have internal predecessors, (883), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 03:25:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:25:31,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:25:31,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:25:31,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:25:31,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:25:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash 66796, now seen corresponding path program 1 times [2024-11-14 03:25:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:25:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917449588] [2024-11-14 03:25:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:25:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:31,879 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 03:25:31,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:25:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917449588] [2024-11-14 03:25:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917449588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:25:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:25:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:25:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558894952] [2024-11-14 03:25:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:25:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:25:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:25:31,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:25:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:25:31,925 INFO L87 Difference]: Start difference. First operand has 791 states, 356 states have (on average 2.480337078651685) internal successors, (883), 784 states have internal predecessors, (883), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:25:34,157 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 03:25:36,189 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 03:25:38,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:25:40,262 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 03:25:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:25:40,919 INFO L93 Difference]: Finished difference Result 777 states and 834 transitions. [2024-11-14 03:25:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:25:40,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-14 03:25:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:25:40,934 INFO L225 Difference]: With dead ends: 777 [2024-11-14 03:25:40,934 INFO L226 Difference]: Without dead ends: 776 [2024-11-14 03:25:40,936 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 03:25:40,938 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 710 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:25:40,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 468 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 462 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2024-11-14 03:25:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-14 03:25:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-11-14 03:25:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 359 states have (on average 2.2701949860724233) internal successors, (815), 769 states have internal predecessors, (815), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 03:25:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 833 transitions. [2024-11-14 03:25:41,038 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 833 transitions. Word has length 2 [2024-11-14 03:25:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:25:41,039 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 833 transitions. [2024-11-14 03:25:41,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:25:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 833 transitions. [2024-11-14 03:25:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:25:41,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:25:41,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:25:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:25:41,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:25:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:25:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 66797, now seen corresponding path program 1 times [2024-11-14 03:25:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:25:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049454131] [2024-11-14 03:25:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:25:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:41,183 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 03:25:41,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:25:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049454131] [2024-11-14 03:25:41,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049454131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:25:41,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:25:41,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:25:41,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697372679] [2024-11-14 03:25:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:25:41,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:25:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:25:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:25:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:25:41,185 INFO L87 Difference]: Start difference. First operand 776 states and 833 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:25:43,351 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 03:25:45,379 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 03:25:47,423 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 03:25:49,436 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 03:25:52,316 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 03:25:54,323 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 03:25:56,344 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 03:25:58,943 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 03:26:00,947 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 03:26:02,969 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 03:26:04,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 03:26:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:05,240 INFO L93 Difference]: Finished difference Result 1298 states and 1405 transitions. [2024-11-14 03:26:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:26:05,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-14 03:26:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:05,248 INFO L225 Difference]: With dead ends: 1298 [2024-11-14 03:26:05,248 INFO L226 Difference]: Without dead ends: 1298 [2024-11-14 03:26:05,249 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 03:26:05,250 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 554 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 14 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:05,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 903 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 734 Invalid, 11 Unknown, 0 Unchecked, 24.0s Time] [2024-11-14 03:26:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-14 03:26:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1035. [2024-11-14 03:26:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 614 states have (on average 2.221498371335505) internal successors, (1364), 1026 states have internal predecessors, (1364), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:26:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1396 transitions. [2024-11-14 03:26:05,307 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1396 transitions. Word has length 2 [2024-11-14 03:26:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:05,307 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1396 transitions. [2024-11-14 03:26:05,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:26:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1396 transitions. [2024-11-14 03:26:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:26:05,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:05,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:26:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:26:05,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:26:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1560010974, now seen corresponding path program 1 times [2024-11-14 03:26:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725223127] [2024-11-14 03:26:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:05,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:05,388 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 03:26:05,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725223127] [2024-11-14 03:26:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725223127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:05,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:26:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633016444] [2024-11-14 03:26:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:05,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:26:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:26:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:26:05,391 INFO L87 Difference]: Start difference. First operand 1035 states and 1396 transitions. Second operand has 3 states, 2 states have (on average 3.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 03:26:07,540 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 03:26:09,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:11,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:12,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:14,862 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 03:26:17,227 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 03:26:19,246 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 03:26:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:19,584 INFO L93 Difference]: Finished difference Result 1192 states and 1561 transitions. [2024-11-14 03:26:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:26:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 03:26:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:19,590 INFO L225 Difference]: With dead ends: 1192 [2024-11-14 03:26:19,590 INFO L226 Difference]: Without dead ends: 1192 [2024-11-14 03:26:19,590 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 03:26:19,594 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 689 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:19,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 710 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 601 Invalid, 5 Unknown, 0 Unchecked, 14.1s Time] [2024-11-14 03:26:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-14 03:26:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 988. [2024-11-14 03:26:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 614 states have (on average 2.1058631921824102) internal successors, (1293), 979 states have internal predecessors, (1293), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:26:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1325 transitions. [2024-11-14 03:26:19,645 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1325 transitions. Word has length 6 [2024-11-14 03:26:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:19,646 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1325 transitions. [2024-11-14 03:26:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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 03:26:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1325 transitions. [2024-11-14 03:26:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:26:19,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:19,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:26:19,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:26:19,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:26:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1560010975, now seen corresponding path program 1 times [2024-11-14 03:26:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121808682] [2024-11-14 03:26:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:19,785 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 03:26:19,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121808682] [2024-11-14 03:26:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121808682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:26:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717895894] [2024-11-14 03:26:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:19,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:26:19,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:26:19,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:26:19,787 INFO L87 Difference]: Start difference. First operand 988 states and 1325 transitions. Second operand has 3 states, 2 states have (on average 3.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 03:26:21,943 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 03:26:25,110 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 03:26:28,608 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 03:26:30,630 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 03:26:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:30,936 INFO L93 Difference]: Finished difference Result 1294 states and 1755 transitions. [2024-11-14 03:26:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:26:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 03:26:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:30,943 INFO L225 Difference]: With dead ends: 1294 [2024-11-14 03:26:30,944 INFO L226 Difference]: Without dead ends: 1294 [2024-11-14 03:26:30,944 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 03:26:30,945 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 515 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 26 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:30,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 900 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 567 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2024-11-14 03:26:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-14 03:26:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 963. [2024-11-14 03:26:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 614 states have (on average 2.026058631921824) internal successors, (1244), 954 states have internal predecessors, (1244), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:26:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1276 transitions. [2024-11-14 03:26:30,976 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1276 transitions. Word has length 6 [2024-11-14 03:26:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1276 transitions. [2024-11-14 03:26:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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 03:26:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1276 transitions. [2024-11-14 03:26:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:26:30,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:30,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:26:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:26:30,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:26:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 557206587, now seen corresponding path program 1 times [2024-11-14 03:26:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61137442] [2024-11-14 03:26:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:31,080 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 03:26:31,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61137442] [2024-11-14 03:26:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61137442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:31,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:26:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828877726] [2024-11-14 03:26:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:31,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:26:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:26:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:26:31,082 INFO L87 Difference]: Start difference. First operand 963 states and 1276 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 03:26:33,165 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 03:26:35,168 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 03:26:37,171 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 03:26:39,195 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 03:26:41,203 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 03:26:43,209 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 03:26:45,404 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 03:26:47,927 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 03:26:49,930 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 03:26:51,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:53,702 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 03:26:55,705 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 03:26:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:56,623 INFO L93 Difference]: Finished difference Result 1281 states and 1746 transitions. [2024-11-14 03:26:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:26:56,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-14 03:26:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:56,632 INFO L225 Difference]: With dead ends: 1281 [2024-11-14 03:26:56,632 INFO L226 Difference]: Without dead ends: 1281 [2024-11-14 03:26:56,632 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 03:26:56,633 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 222 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:56,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1848 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 11 Unknown, 0 Unchecked, 25.5s Time] [2024-11-14 03:26:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-14 03:26:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 965. [2024-11-14 03:26:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 616 states have (on average 2.022727272727273) internal successors, (1246), 956 states have internal predecessors, (1246), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:26:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1278 transitions. [2024-11-14 03:26:56,667 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1278 transitions. Word has length 9 [2024-11-14 03:26:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1278 transitions. [2024-11-14 03:26:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 03:26:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1278 transitions. [2024-11-14 03:26:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:26:56,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:56,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:26:56,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:26:56,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:26:56,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 467841397, now seen corresponding path program 1 times [2024-11-14 03:26:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:56,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977667311] [2024-11-14 03:26:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:56,841 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 03:26:56,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:56,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977667311] [2024-11-14 03:26:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977667311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:56,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:56,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:26:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356892414] [2024-11-14 03:26:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:56,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:26:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:26:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:26:56,844 INFO L87 Difference]: Start difference. First operand 965 states and 1278 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:58,947 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 03:27:00,978 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 03:27:02,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:04,758 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 03:27:05,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:07,832 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 03:27:09,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:10,172 INFO L93 Difference]: Finished difference Result 950 states and 1240 transitions. [2024-11-14 03:27:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:27:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 03:27:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:10,178 INFO L225 Difference]: With dead ends: 950 [2024-11-14 03:27:10,178 INFO L226 Difference]: Without dead ends: 950 [2024-11-14 03:27:10,178 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 03:27:10,180 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 725 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:10,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 625 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 820 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2024-11-14 03:27:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-14 03:27:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 942. [2024-11-14 03:27:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 616 states have (on average 1.948051948051948) internal successors, (1200), 933 states have internal predecessors, (1200), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:27:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1232 transitions. [2024-11-14 03:27:10,213 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1232 transitions. Word has length 14 [2024-11-14 03:27:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:10,213 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1232 transitions. [2024-11-14 03:27:10,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1232 transitions. [2024-11-14 03:27:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:27:10,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:10,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:10,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:27:10,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:27:10,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 467841398, now seen corresponding path program 1 times [2024-11-14 03:27:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:10,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374760407] [2024-11-14 03:27:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:10,499 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 03:27:10,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374760407] [2024-11-14 03:27:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374760407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:10,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:10,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:27:10,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827999691] [2024-11-14 03:27:10,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:10,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:27:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:10,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:27:10,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:27:10,501 INFO L87 Difference]: Start difference. First operand 942 states and 1232 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:12,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 03:27:13,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:15,812 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 03:27:19,074 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 03:27:21,076 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 03:27:23,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 03:27:25,106 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 03:27:27,523 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 03:27:29,530 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 03:27:32,523 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 03:27:33,535 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 03:27:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:33,632 INFO L93 Difference]: Finished difference Result 1261 states and 1605 transitions. [2024-11-14 03:27:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:27:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 03:27:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:33,638 INFO L225 Difference]: With dead ends: 1261 [2024-11-14 03:27:33,638 INFO L226 Difference]: Without dead ends: 1261 [2024-11-14 03:27:33,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:27:33,641 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 610 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 24 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:33,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 974 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 969 Invalid, 9 Unknown, 0 Unchecked, 23.1s Time] [2024-11-14 03:27:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2024-11-14 03:27:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1032. [2024-11-14 03:27:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 706 states have (on average 1.8611898016997168) internal successors, (1314), 1023 states have internal predecessors, (1314), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:27:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1346 transitions. [2024-11-14 03:27:33,672 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1346 transitions. Word has length 14 [2024-11-14 03:27:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:33,673 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1346 transitions. [2024-11-14 03:27:33,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1346 transitions. [2024-11-14 03:27:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:27:33,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:33,675 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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 03:27:33,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:27:33,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:27:33,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash 302484655, now seen corresponding path program 1 times [2024-11-14 03:27:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346279311] [2024-11-14 03:27:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:27:34,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:34,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346279311] [2024-11-14 03:27:34,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346279311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:34,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:34,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:27:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400255496] [2024-11-14 03:27:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:34,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:27:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:27:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:27:34,099 INFO L87 Difference]: Start difference. First operand 1032 states and 1346 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 03:27:36,169 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 03:27:38,174 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 03:27:40,267 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 03:27:42,271 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 03:27:44,287 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 03:27:46,290 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 03:27:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:46,358 INFO L93 Difference]: Finished difference Result 889 states and 1154 transitions. [2024-11-14 03:27:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:27:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 03:27:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:46,362 INFO L225 Difference]: With dead ends: 889 [2024-11-14 03:27:46,362 INFO L226 Difference]: Without dead ends: 889 [2024-11-14 03:27:46,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:27:46,363 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 40 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:46,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1150 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 12.2s Time] [2024-11-14 03:27:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-14 03:27:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2024-11-14 03:27:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 586 states have (on average 1.9146757679180888) internal successors, (1122), 880 states have internal predecessors, (1122), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:27:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1154 transitions. [2024-11-14 03:27:46,387 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1154 transitions. Word has length 30 [2024-11-14 03:27:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:46,387 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1154 transitions. [2024-11-14 03:27:46,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 03:27:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1154 transitions. [2024-11-14 03:27:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 03:27:46,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:46,388 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] [2024-11-14 03:27:46,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:27:46,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:27:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash 380221845, now seen corresponding path program 1 times [2024-11-14 03:27:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444432868] [2024-11-14 03:27:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:46,601 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 03:27:46,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444432868] [2024-11-14 03:27:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444432868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:46,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:27:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133283603] [2024-11-14 03:27:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:46,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:27:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:27:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:27:46,606 INFO L87 Difference]: Start difference. First operand 889 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 03:27:48,719 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 03:27:51,139 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 03:27:53,141 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 03:27:55,146 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 03:27:57,171 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 03:27:59,174 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 03:27:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:59,766 INFO L93 Difference]: Finished difference Result 915 states and 1172 transitions. [2024-11-14 03:27:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:27:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2024-11-14 03:27:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:59,770 INFO L225 Difference]: With dead ends: 915 [2024-11-14 03:27:59,770 INFO L226 Difference]: Without dead ends: 915 [2024-11-14 03:27:59,770 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 03:27:59,771 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 36 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 25 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:59,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1703 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 13.1s Time] [2024-11-14 03:27:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-11-14 03:27:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2024-11-14 03:27:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 610 states have (on average 1.8655737704918032) internal successors, (1138), 904 states have internal predecessors, (1138), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 03:27:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1170 transitions. [2024-11-14 03:27:59,792 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1170 transitions. Word has length 45 [2024-11-14 03:27:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:59,792 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1170 transitions. [2024-11-14 03:27:59,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 03:27:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1170 transitions. [2024-11-14 03:27:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 03:27:59,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:59,793 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] [2024-11-14 03:27:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:27:59,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:27:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash -338074090, now seen corresponding path program 1 times [2024-11-14 03:27:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177249657] [2024-11-14 03:27:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:00,004 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 03:28:00,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:00,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177249657] [2024-11-14 03:28:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177249657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:28:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59962510] [2024-11-14 03:28:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:28:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:28:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:28:00,009 INFO L87 Difference]: Start difference. First operand 913 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 03:28:02,054 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 03:28:03,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:06,168 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 03:28:08,172 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 03:28:10,190 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 03:28:12,193 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 03:28:14,280 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 03:28:16,296 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 03:28:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:16,364 INFO L93 Difference]: Finished difference Result 1193 states and 1554 transitions. [2024-11-14 03:28:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:28:16,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2024-11-14 03:28:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:16,368 INFO L225 Difference]: With dead ends: 1193 [2024-11-14 03:28:16,368 INFO L226 Difference]: Without dead ends: 1193 [2024-11-14 03:28:16,368 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 03:28:16,369 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 162 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:16,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1246 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 7 Unknown, 0 Unchecked, 16.3s Time] [2024-11-14 03:28:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-14 03:28:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1136. [2024-11-14 03:28:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 823 states have (on average 1.8213851761846902) internal successors, (1499), 1127 states have internal predecessors, (1499), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:28:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1551 transitions. [2024-11-14 03:28:16,398 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1551 transitions. Word has length 49 [2024-11-14 03:28:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:16,399 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1551 transitions. [2024-11-14 03:28:16,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 03:28:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1551 transitions. [2024-11-14 03:28:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 03:28:16,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:16,402 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] [2024-11-14 03:28:16,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:28:16,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:28:16,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1913064889, now seen corresponding path program 1 times [2024-11-14 03:28:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:28:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682313733] [2024-11-14 03:28:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:28:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:16,941 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 03:28:16,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682313733] [2024-11-14 03:28:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682313733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:28:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627653813] [2024-11-14 03:28:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:28:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:28:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:28:16,943 INFO L87 Difference]: Start difference. First operand 1136 states and 1551 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 03:28:19,023 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 03:28:21,026 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 03:28:23,029 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 03:28:24,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:26,399 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 03:28:28,403 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 03:28:30,406 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 03:28:32,409 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 03:28:34,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:36,473 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 03:28:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:37,504 INFO L93 Difference]: Finished difference Result 1135 states and 1549 transitions. [2024-11-14 03:28:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:28:37,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2024-11-14 03:28:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:37,510 INFO L225 Difference]: With dead ends: 1135 [2024-11-14 03:28:37,510 INFO L226 Difference]: Without dead ends: 1135 [2024-11-14 03:28:37,510 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 03:28:37,510 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 2 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:37,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1601 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1118 Invalid, 9 Unknown, 0 Unchecked, 20.5s Time] [2024-11-14 03:28:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-14 03:28:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2024-11-14 03:28:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 823 states have (on average 1.818955042527339) internal successors, (1497), 1126 states have internal predecessors, (1497), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:28:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1549 transitions. [2024-11-14 03:28:37,536 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1549 transitions. Word has length 56 [2024-11-14 03:28:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:37,537 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1549 transitions. [2024-11-14 03:28:37,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 03:28:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1549 transitions. [2024-11-14 03:28:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 03:28:37,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:37,541 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] [2024-11-14 03:28:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:28:37,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:28:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1913064890, now seen corresponding path program 1 times [2024-11-14 03:28:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:28:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425693334] [2024-11-14 03:28:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:28:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:38,323 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 03:28:38,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:38,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425693334] [2024-11-14 03:28:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425693334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:28:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419425663] [2024-11-14 03:28:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:38,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:28:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:28:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:28:38,326 INFO L87 Difference]: Start difference. First operand 1135 states and 1549 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 03:28:41,049 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 03:28:43,069 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 03:28:44,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:46,449 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 03:28:48,453 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 03:28:50,457 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 03:28:52,460 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 03:28:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:52,966 INFO L93 Difference]: Finished difference Result 1134 states and 1547 transitions. [2024-11-14 03:28:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:28:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2024-11-14 03:28:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:52,971 INFO L225 Difference]: With dead ends: 1134 [2024-11-14 03:28:52,971 INFO L226 Difference]: Without dead ends: 1134 [2024-11-14 03:28:52,971 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 03:28:52,971 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 1 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:52,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1539 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1180 Invalid, 6 Unknown, 0 Unchecked, 14.6s Time] [2024-11-14 03:28:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-11-14 03:28:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2024-11-14 03:28:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 821 states have (on average 1.8209500609013398) internal successors, (1495), 1125 states have internal predecessors, (1495), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:28:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1547 transitions. [2024-11-14 03:28:52,994 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1547 transitions. Word has length 56 [2024-11-14 03:28:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:52,995 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1547 transitions. [2024-11-14 03:28:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 03:28:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1547 transitions. [2024-11-14 03:28:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 03:28:52,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:52,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:28:52,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:28:52,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:28:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 682152479, now seen corresponding path program 1 times [2024-11-14 03:28:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:28:52,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555757296] [2024-11-14 03:28:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:28:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:53,356 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 03:28:53,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555757296] [2024-11-14 03:28:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555757296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:53,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:28:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73053259] [2024-11-14 03:28:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:28:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:28:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:28:53,359 INFO L87 Difference]: Start difference. First operand 1134 states and 1547 transitions. Second operand has 7 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:28:57,542 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 03:28:59,544 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 03:29:01,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:29:03,558 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 03:29:05,560 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 03:29:07,563 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 03:29:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:08,165 INFO L93 Difference]: Finished difference Result 1149 states and 1570 transitions. [2024-11-14 03:29:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:29:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-14 03:29:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:08,170 INFO L225 Difference]: With dead ends: 1149 [2024-11-14 03:29:08,170 INFO L226 Difference]: Without dead ends: 1149 [2024-11-14 03:29:08,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:29:08,171 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 12 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:08,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2488 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1585 Invalid, 6 Unknown, 0 Unchecked, 14.7s Time] [2024-11-14 03:29:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-14 03:29:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1142. [2024-11-14 03:29:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 828 states have (on average 1.817632850241546) internal successors, (1505), 1131 states have internal predecessors, (1505), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-14 03:29:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1562 transitions. [2024-11-14 03:29:08,195 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1562 transitions. Word has length 62 [2024-11-14 03:29:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1562 transitions. [2024-11-14 03:29:08,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:29:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1562 transitions. [2024-11-14 03:29:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 03:29:08,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:08,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:29:08,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:29:08,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:29:08,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash 682152480, now seen corresponding path program 1 times [2024-11-14 03:29:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:29:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232326651] [2024-11-14 03:29:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:29:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:08,930 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 03:29:08,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:29:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232326651] [2024-11-14 03:29:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232326651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:29:08,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:29:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:29:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854287778] [2024-11-14 03:29:08,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:29:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:29:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:29:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:29:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:29:08,934 INFO L87 Difference]: Start difference. First operand 1142 states and 1562 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:29:11,035 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 03:29:13,037 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 03:29:15,046 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 03:29:17,050 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 03:29:19,052 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 03:29:21,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 03:29:23,444 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 03:29:25,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:29:27,230 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 03:29:29,232 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 03:29:31,235 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 03:29:33,239 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 03:29:35,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:29:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:35,878 INFO L93 Difference]: Finished difference Result 1142 states and 1560 transitions. [2024-11-14 03:29:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:29:35,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-14 03:29:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:35,884 INFO L225 Difference]: With dead ends: 1142 [2024-11-14 03:29:35,884 INFO L226 Difference]: Without dead ends: 1142 [2024-11-14 03:29:35,885 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 03:29:35,886 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 8 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 8 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:35,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1976 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1405 Invalid, 12 Unknown, 0 Unchecked, 26.9s Time] [2024-11-14 03:29:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-14 03:29:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2024-11-14 03:29:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 828 states have (on average 1.815217391304348) internal successors, (1503), 1131 states have internal predecessors, (1503), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-14 03:29:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1560 transitions. [2024-11-14 03:29:35,918 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1560 transitions. Word has length 62 [2024-11-14 03:29:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:35,918 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1560 transitions. [2024-11-14 03:29:35,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:29:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1560 transitions. [2024-11-14 03:29:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 03:29:35,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:35,920 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 03:29:35,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:29:35,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:29:35,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash -458342963, now seen corresponding path program 1 times [2024-11-14 03:29:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:29:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643784798] [2024-11-14 03:29:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:29:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:36,672 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 03:29:36,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:29:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643784798] [2024-11-14 03:29:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643784798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369832633] [2024-11-14 03:29:36,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:36,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:29:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:29:36,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:29:36,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:29:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:36,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 03:29:36,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:36,987 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 03:29:37,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:29:37,124 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 03:29:37,183 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 03:29:37,296 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 03:29:37,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:37,522 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 03:29:37,586 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 03:29:37,633 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 03:29:37,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369832633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1115743471] [2024-11-14 03:29:37,769 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-14 03:29:37,769 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:29:37,774 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:29:37,780 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:29:37,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:29:44,572 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 03:29:44,905 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:33:03,968 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30889#(and (<= 1 |#StackHeapBarrier|) (or (and (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_#length_619| (Array Int Int)) (|v_#valid_633| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= (select |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |#length| (store |v_#length_619| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (<= 40 (select |v_#length_619| |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 (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)))) (= (select |v_#valid_633| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (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_#Ultimate.C_memset_#t~loopctr228_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_18| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_18|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#memory_int_427| (Array Int (Array Int Int))) (|v_#memory_int_426| (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_424| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_427|) (= (store |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_427| |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 (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_424|) (= (store |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_426|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr228_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_18| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_18|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#memory_int_427| (Array Int (Array Int Int))) (|v_#memory_int_426| (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_424| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_427|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_424|) (= (store |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_426|) (= (store |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_2|))) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#length_619| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#valid_633| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= (store |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (<= 40 (select |v_#length_619| |ULTIMATE.start_main_~user~0#1.base|)) (= |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)))) (= |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 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (select |v_#valid_633| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (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|) (= |#length| (store |v_#length_619| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)))))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= ~count_int_int~0 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 03:33:03,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:33:03,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:33:03,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-14 03:33:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698924346] [2024-11-14 03:33:03,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:33:03,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:33:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:33:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:33:03,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2696, Unknown=114, NotChecked=0, Total=3080 [2024-11-14 03:33:03,973 INFO L87 Difference]: Start difference. First operand 1142 states and 1560 transitions. Second operand has 19 states, 16 states have (on average 6.6875) internal successors, (107), 18 states have internal predecessors, (107), 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 03:33:06,619 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 03:33:08,624 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 03:33:10,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:33:12,631 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 03:33:14,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:33:16,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:33:18,645 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 03:33:20,648 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 03:33:22,652 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 03:33:24,655 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 03:33:26,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:28,661 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 03:33:30,664 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 03:33:32,667 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 03:33:34,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:33:42,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:33:44,554 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 03:33:46,557 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 03:33:48,560 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 03:33:50,563 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 03:33:53,365 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 03:33:55,369 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 03:34:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:03,573 INFO L93 Difference]: Finished difference Result 1146 states and 1563 transitions. [2024-11-14 03:34:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:34:03,574 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.6875) internal successors, (107), 18 states have internal predecessors, (107), 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 63 [2024-11-14 03:34:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:03,579 INFO L225 Difference]: With dead ends: 1146 [2024-11-14 03:34:03,579 INFO L226 Difference]: Without dead ends: 1146 [2024-11-14 03:34:03,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 199.9s TimeCoverageRelationStatistics Valid=302, Invalid=3123, Unknown=115, NotChecked=0, Total=3540 [2024-11-14 03:34:03,581 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 617 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 4830 mSolverCounterSat, 21 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 4873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4830 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:34:03,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 3875 Invalid, 4873 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4830 Invalid, 22 Unknown, 0 Unchecked, 59.0s Time] [2024-11-14 03:34:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-11-14 03:34:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1144. [2024-11-14 03:34:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 830 states have (on average 1.8120481927710843) internal successors, (1504), 1132 states have internal predecessors, (1504), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-14 03:34:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1558 transitions. [2024-11-14 03:34:03,607 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1558 transitions. Word has length 63 [2024-11-14 03:34:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:03,607 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1558 transitions. [2024-11-14 03:34:03,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.6875) internal successors, (107), 18 states have internal predecessors, (107), 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 03:34:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1558 transitions. [2024-11-14 03:34:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 03:34:03,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:03,609 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 03:34:03,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 03:34:03,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:34:03,813 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:34:03,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash -458342962, now seen corresponding path program 1 times [2024-11-14 03:34:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414264559] [2024-11-14 03:34:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:03,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:05,392 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 03:34:05,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414264559] [2024-11-14 03:34:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414264559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:34:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579330464] [2024-11-14 03:34:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:34:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:34:05,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:34:05,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:34:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:05,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 03:34:05,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:34:05,702 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 03:34:06,079 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 8 treesize of output 1 [2024-11-14 03:34:06,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:34:06,114 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 03:34:06,239 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 03:34:06,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:34:06,590 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 03:34:06,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:34:06,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:34:06,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:34:06,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 03:34:07,137 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 03:34:07,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:34:07,265 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 03:34:07,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:34:07,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_709 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:34:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579330464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:34:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420419001] [2024-11-14 03:34:07,695 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-14 03:34:07,695 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:34:07,696 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:34:07,696 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:34:07,696 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:34:14,169 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 130 for LOIs [2024-11-14 03:34:14,801 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:37:45,480 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33442#(and (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_623| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_638| (Array Int Int))) (and (= (select |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= (+ (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)))) (= (select |v_#valid_638| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (store |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |#length| (store |v_#length_623| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (<= 40 (select |v_#length_623| |ULTIMATE.start_main_~user~0#1.base|)))) (exists ((|v_#memory_int_445| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_446| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_#memory_int_443| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_446|) (= (store |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_445|) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_446| |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)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_443|))) (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~loopctr228_30| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_30| 4294967296))))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#length_623| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_638| (Array Int Int))) (and (= |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|) (= (store |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_638| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (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_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (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|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_623| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#length_623| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_int_445| (Array Int (Array Int Int))) (|v_#memory_int_446| (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_443| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_446|) (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_446| |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_443| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_445|) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_443|))) (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~loopctr228_30| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_30| 4294967296)))))) (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) (= ~count_int_int~0 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-14 03:37:45,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:37:45,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:37:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-14 03:37:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888446679] [2024-11-14 03:37:45,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:37:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:37:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:37:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:37:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2702, Unknown=109, NotChecked=108, Total=3192 [2024-11-14 03:37:45,483 INFO L87 Difference]: Start difference. First operand 1144 states and 1558 transitions. Second operand has 18 states, 15 states have (on average 7.133333333333334) internal successors, (107), 18 states have internal predecessors, (107), 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 03:37:48,243 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 03:37:50,250 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 03:37:52,255 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 03:37:54,258 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 03:37:56,263 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 03:37:58,267 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 03:38:00,271 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 03:38:02,274 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 03:38:04,277 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 03:38:06,281 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 03:38:16,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:38:27,105 INFO L93 Difference]: Finished difference Result 1145 states and 1561 transitions. [2024-11-14 03:38:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:38:27,106 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.133333333333334) internal successors, (107), 18 states have internal predecessors, (107), 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 63 [2024-11-14 03:38:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:38:27,112 INFO L225 Difference]: With dead ends: 1145 [2024-11-14 03:38:27,112 INFO L226 Difference]: Without dead ends: 1145 [2024-11-14 03:38:27,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 212.6s TimeCoverageRelationStatistics Valid=311, Invalid=3124, Unknown=109, NotChecked=116, Total=3660 [2024-11-14 03:38:27,114 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 605 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 5437 mSolverCounterSat, 23 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 5470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5437 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:38:27,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 2670 Invalid, 5470 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5437 Invalid, 10 Unknown, 0 Unchecked, 40.9s Time] [2024-11-14 03:38:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-14 03:38:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1135. [2024-11-14 03:38:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 823 states have (on average 1.8153098420413123) internal successors, (1494), 1125 states have internal predecessors, (1494), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:38:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1546 transitions. [2024-11-14 03:38:27,141 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1546 transitions. Word has length 63 [2024-11-14 03:38:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:38:27,141 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1546 transitions. [2024-11-14 03:38:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.133333333333334) internal successors, (107), 18 states have internal predecessors, (107), 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 03:38:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1546 transitions. [2024-11-14 03:38:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 03:38:27,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:38:27,143 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 03:38:27,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:38:27,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:38:27,344 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:38:27,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:38:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1579966012, now seen corresponding path program 1 times [2024-11-14 03:38:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:38:27,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439363030] [2024-11-14 03:38:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:38:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:28,738 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 03:38:28,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:38:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439363030] [2024-11-14 03:38:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439363030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:38:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:38:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 03:38:28,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505956624] [2024-11-14 03:38:28,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:38:28,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:38:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:38:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:38:28,743 INFO L87 Difference]: Start difference. First operand 1135 states and 1546 transitions. Second operand has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:38:31,287 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 03:38:33,292 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 03:38:35,298 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 03:38:42,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 03:38:44,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:46,022 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 03:38:47,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:50,041 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 03:38:51,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:38:57,045 INFO L93 Difference]: Finished difference Result 1150 states and 1567 transitions. [2024-11-14 03:38:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:38:57,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-14 03:38:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:38:57,049 INFO L225 Difference]: With dead ends: 1150 [2024-11-14 03:38:57,049 INFO L226 Difference]: Without dead ends: 1150 [2024-11-14 03:38:57,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-14 03:38:57,050 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 618 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 19 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:38:57,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2685 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3424 Invalid, 7 Unknown, 0 Unchecked, 27.9s Time] [2024-11-14 03:38:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-14 03:38:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1147. [2024-11-14 03:38:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 834 states have (on average 1.8081534772182255) internal successors, (1508), 1135 states have internal predecessors, (1508), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-14 03:38:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1562 transitions. [2024-11-14 03:38:57,070 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1562 transitions. Word has length 64 [2024-11-14 03:38:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:38:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1562 transitions. [2024-11-14 03:38:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:38:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1562 transitions. [2024-11-14 03:38:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 03:38:57,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:38:57,072 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 03:38:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:38:57,072 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:38:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:38:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1579966011, now seen corresponding path program 1 times [2024-11-14 03:38:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:38:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804445149] [2024-11-14 03:38:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:38:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:58,397 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 03:38:58,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:38:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804445149] [2024-11-14 03:38:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804445149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:38:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:38:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:38:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353262733] [2024-11-14 03:38:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:38:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:38:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:38:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:38:58,399 INFO L87 Difference]: Start difference. First operand 1147 states and 1562 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:39:00,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:39:06,858 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 03:39:08,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 03:39:10,865 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 03:39:12,874 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 03:39:14,879 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 03:39:16,883 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 03:39:18,887 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 03:39:20,901 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 03:39:23,759 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 03:39:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:30,762 INFO L93 Difference]: Finished difference Result 1149 states and 1565 transitions. [2024-11-14 03:39:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:39:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-14 03:39:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:30,765 INFO L225 Difference]: With dead ends: 1149 [2024-11-14 03:39:30,765 INFO L226 Difference]: Without dead ends: 1149 [2024-11-14 03:39:30,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:39:30,766 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 625 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 17 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:30,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1764 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3675 Invalid, 9 Unknown, 0 Unchecked, 32.0s Time] [2024-11-14 03:39:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-14 03:39:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1147. [2024-11-14 03:39:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 834 states have (on average 1.8057553956834533) internal successors, (1506), 1135 states have internal predecessors, (1506), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-14 03:39:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1560 transitions. [2024-11-14 03:39:30,787 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1560 transitions. Word has length 64 [2024-11-14 03:39:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:30,787 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1560 transitions. [2024-11-14 03:39:30,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:39:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1560 transitions. [2024-11-14 03:39:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 03:39:30,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:30,789 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 03:39:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:39:30,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 03:39:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1915542002, now seen corresponding path program 1 times [2024-11-14 03:39:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569903441] [2024-11-14 03:39:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:32,168 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 03:39:32,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569903441] [2024-11-14 03:39:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569903441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597463176] [2024-11-14 03:39:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:32,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:32,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:39:32,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:39:32,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a88776f4-ccf3-4fcb-bc8b-4aff0390fc8b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:39:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:32,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:39:32,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:39:32,512 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 03:39:32,856 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:39:32,856 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 03:39:32,964 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 03:39:33,219 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 03:39:33,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:39:33,635 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 03:39:33,916 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:39:33,916 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 03:39:33,937 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 03:39:34,054 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 03:39:34,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:39:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597463176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1465041302] [2024-11-14 03:39:34,564 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-14 03:39:34,564 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:39:34,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:39:34,565 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:39:34,565 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:39:40,884 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 03:39:41,147 INFO L180 IcfgInterpreter]: Interpretation finished